TSTP Solution File: GEO169+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO169+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:34 EDT 2022
% Result : Timeout 299.86s 300.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO169+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.32 % Computer : n023.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Wed Jul 27 07:16:48 EDT 2022
% 0.12/0.32 % CPUTime :
% 1.96/2.15 ----- Otter 3.3f, August 2004 -----
% 1.96/2.15 The process was started by sandbox2 on n023.cluster.edu,
% 1.96/2.15 Wed Jul 27 07:16:48 2022
% 1.96/2.15 The command was "./otter". The process ID is 15078.
% 1.96/2.15
% 1.96/2.15 set(prolog_style_variables).
% 1.96/2.15 set(auto).
% 1.96/2.15 dependent: set(auto1).
% 1.96/2.15 dependent: set(process_input).
% 1.96/2.15 dependent: clear(print_kept).
% 1.96/2.15 dependent: clear(print_new_demod).
% 1.96/2.15 dependent: clear(print_back_demod).
% 1.96/2.15 dependent: clear(print_back_sub).
% 1.96/2.15 dependent: set(control_memory).
% 1.96/2.15 dependent: assign(max_mem, 12000).
% 1.96/2.15 dependent: assign(pick_given_ratio, 4).
% 1.96/2.15 dependent: assign(stats_level, 1).
% 1.96/2.15 dependent: assign(max_seconds, 10800).
% 1.96/2.15 clear(print_given).
% 1.96/2.15
% 1.96/2.15 formula_list(usable).
% 1.96/2.15 all A (incident(p3,A)&incident(p1,A)&incident(p2,A)->goal).
% 1.96/2.15 incident(a1,b2b3)&incident(a2,b3b1)&incident(a3,b1b2)->goal.
% 1.96/2.15 incident(b1,a2a3)&incident(b2,a3a1)&incident(b3,a1a2)->goal.
% 1.96/2.15 incident(a1,b2b3)|incident(b3,a1a2).
% 1.96/2.15 incident(a2,b3b1)|incident(b1,a2a3).
% 1.96/2.15 incident(a3,b1b2)|incident(b2,a3a1).
% 1.96/2.15 incident(a1,a1a2).
% 1.96/2.15 incident(a2,a1a2).
% 1.96/2.15 incident(a2,a2a3).
% 1.96/2.15 incident(a3,a2a3).
% 1.96/2.15 incident(a3,a3a1).
% 1.96/2.15 incident(a1,a3a1).
% 1.96/2.15 incident(b1,b1b2).
% 1.96/2.15 incident(b2,b1b2).
% 1.96/2.15 incident(b2,b2b3).
% 1.96/2.15 incident(b3,b2b3).
% 1.96/2.15 incident(b3,b3b1).
% 1.96/2.15 incident(b1,b3b1).
% 1.96/2.15 incident(s,s1).
% 1.96/2.15 incident(s,s2).
% 1.96/2.15 incident(s,s3).
% 1.96/2.15 incident(a1,s1).
% 1.96/2.15 incident(a2,s2).
% 1.96/2.15 incident(a3,s3).
% 1.96/2.15 incident(b1,s1).
% 1.96/2.15 incident(b2,s2).
% 1.96/2.15 incident(b3,s3).
% 1.96/2.15 incident(p3,a1a2).
% 1.96/2.15 incident(p3,b1b2).
% 1.96/2.15 incident(p1,a2a3).
% 1.96/2.15 incident(p1,b2b3).
% 1.96/2.15 incident(p2,a3a1).
% 1.96/2.15 incident(p2,b3b1).
% 1.96/2.15 all A B (incident(A,B)->point(A)).
% 1.96/2.15 all A B (incident(A,B)->line(B)).
% 1.96/2.15 a1=a2->goal.
% 1.96/2.15 a2=a3->goal.
% 1.96/2.15 a3=a1->goal.
% 1.96/2.15 b1=b2->goal.
% 1.96/2.15 b2=b3->goal.
% 1.96/2.15 b3=b1->goal.
% 1.96/2.15 a1a2=b1b2->goal.
% 1.96/2.15 a2a3=b2b3->goal.
% 1.96/2.15 a3a1=b3b1->goal.
% 1.96/2.15 all A (A=A).
% 1.96/2.15 all A B (A=B->B=A).
% 1.96/2.15 all A B C (A=B&B=C->A=C).
% 1.96/2.15 all A B C (A=B&incident(B,C)->incident(A,C)).
% 1.96/2.15 all A B C (incident(A,B)&B=C->incident(A,C)).
% 1.96/2.15 all A B C D (incident(A,C)&incident(A,D)&incident(B,C)&incident(B,D)->A=B|C=D).
% 1.96/2.15 all A B (point(A)&point(B)-> (exists C (incident(A,C)&incident(B,C)))).
% 1.96/2.15 all A B (line(A)&line(B)-> (exists C (incident(C,A)&incident(C,B)))).
% 1.96/2.15 -goal.
% 1.96/2.15 end_of_list.
% 1.96/2.15
% 1.96/2.15 -------> usable clausifies to:
% 1.96/2.15
% 1.96/2.15 list(usable).
% 1.96/2.15 0 [] -incident(p3,A)| -incident(p1,A)| -incident(p2,A)|goal.
% 1.96/2.15 0 [] -incident(a1,b2b3)| -incident(a2,b3b1)| -incident(a3,b1b2)|goal.
% 1.96/2.15 0 [] -incident(b1,a2a3)| -incident(b2,a3a1)| -incident(b3,a1a2)|goal.
% 1.96/2.15 0 [] incident(a1,b2b3)|incident(b3,a1a2).
% 1.96/2.15 0 [] incident(a2,b3b1)|incident(b1,a2a3).
% 1.96/2.15 0 [] incident(a3,b1b2)|incident(b2,a3a1).
% 1.96/2.15 0 [] incident(a1,a1a2).
% 1.96/2.15 0 [] incident(a2,a1a2).
% 1.96/2.15 0 [] incident(a2,a2a3).
% 1.96/2.15 0 [] incident(a3,a2a3).
% 1.96/2.15 0 [] incident(a3,a3a1).
% 1.96/2.15 0 [] incident(a1,a3a1).
% 1.96/2.15 0 [] incident(b1,b1b2).
% 1.96/2.15 0 [] incident(b2,b1b2).
% 1.96/2.15 0 [] incident(b2,b2b3).
% 1.96/2.15 0 [] incident(b3,b2b3).
% 1.96/2.15 0 [] incident(b3,b3b1).
% 1.96/2.15 0 [] incident(b1,b3b1).
% 1.96/2.15 0 [] incident(s,s1).
% 1.96/2.15 0 [] incident(s,s2).
% 1.96/2.15 0 [] incident(s,s3).
% 1.96/2.15 0 [] incident(a1,s1).
% 1.96/2.15 0 [] incident(a2,s2).
% 1.96/2.15 0 [] incident(a3,s3).
% 1.96/2.15 0 [] incident(b1,s1).
% 1.96/2.15 0 [] incident(b2,s2).
% 1.96/2.15 0 [] incident(b3,s3).
% 1.96/2.15 0 [] incident(p3,a1a2).
% 1.96/2.15 0 [] incident(p3,b1b2).
% 1.96/2.15 0 [] incident(p1,a2a3).
% 1.96/2.15 0 [] incident(p1,b2b3).
% 1.96/2.15 0 [] incident(p2,a3a1).
% 1.96/2.15 0 [] incident(p2,b3b1).
% 1.96/2.15 0 [] -incident(A,B)|point(A).
% 1.96/2.15 0 [] -incident(A,B)|line(B).
% 1.96/2.15 0 [] a1!=a2|goal.
% 1.96/2.15 0 [] a2!=a3|goal.
% 1.96/2.15 0 [] a3!=a1|goal.
% 1.96/2.15 0 [] b1!=b2|goal.
% 1.96/2.15 0 [] b2!=b3|goal.
% 1.96/2.15 0 [] b3!=b1|goal.
% 1.96/2.15 0 [] a1a2!=b1b2|goal.
% 1.96/2.15 0 [] a2a3!=b2b3|goal.
% 1.96/2.15 0 [] a3a1!=b3b1|goal.
% 1.96/2.15 0 [] A=A.
% 1.96/2.15 0 [] A!=B|B=A.
% 1.96/2.15 0 [] A!=B|B!=C|A=C.
% 1.96/2.15 0 [] A!=B| -incident(B,C)|incident(A,C).
% 1.96/2.15 0 [] -incident(A,B)|B!=C|incident(A,C).
% 1.96/2.15 0 [] -incident(A,C)| -incident(A,D)| -incident(B,C)| -incident(B,D)|A=B|C=D.
% 1.96/2.15 0 [] -point(A)| -point(B)|incident(A,$f1(A,B)).
% 1.96/2.15 0 [] -point(A)| -point(B)|incident(B,$f1(A,B)).
% 1.96/2.15 0 [] -line(A)| -line(B)|incident($f2(A,B),A).
% 1.96/2.15 0 [] -line(A)| -line(B)|incident($f2(A,B),B).
% 1.96/2.15 0 [] -goal.
% 1.96/2.15 end_of_list.
% 1.96/2.15
% 1.96/2.15 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=6.
% 1.96/2.15
% 1.96/2.15 This ia a non-Horn set with equality. The strategy will be
% 1.96/2.15 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.96/2.15 deletion, with positive clauses in sos and nonpositive
% 1.96/2.15 clauses in usable.
% 1.96/2.15
% 1.96/2.15 dependent: set(knuth_bendix).
% 1.96/2.15 dependent: set(anl_eq).
% 1.96/2.15 dependent: set(para_from).
% 1.96/2.15 dependent: set(para_into).
% 1.96/2.15 dependent: clear(para_from_right).
% 299.86/300.02 Alarm clock
% 299.86/300.02 Otter interrupted
% 299.86/300.02 PROOF NOT FOUND
%------------------------------------------------------------------------------