TSTP Solution File: GEO167+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : GEO167+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n016.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.87s 300.04s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : GEO167+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n016.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:33:52 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 23.73/23.91  ----- Otter 3.3f, August 2004 -----
% 23.73/23.91  The process was started by sandbox2 on n016.cluster.edu,
% 23.73/23.91  Wed Jul 27 07:33:52 2022
% 23.73/23.91  The command was "./otter".  The process ID is 4629.
% 23.73/23.91  
% 23.73/23.91  set(prolog_style_variables).
% 23.73/23.91  set(auto).
% 23.73/23.91     dependent: set(auto1).
% 23.73/23.91     dependent: set(process_input).
% 23.73/23.91     dependent: clear(print_kept).
% 23.73/23.91     dependent: clear(print_new_demod).
% 23.73/23.91     dependent: clear(print_back_demod).
% 23.73/23.91     dependent: clear(print_back_sub).
% 23.73/23.91     dependent: set(control_memory).
% 23.73/23.91     dependent: assign(max_mem, 12000).
% 23.73/23.91     dependent: assign(pick_given_ratio, 4).
% 23.73/23.91     dependent: assign(stats_level, 1).
% 23.73/23.91     dependent: assign(max_seconds, 10800).
% 23.73/23.91  clear(print_given).
% 23.73/23.91  
% 23.73/23.91  formula_list(usable).
% 23.73/23.91  colinear(a,b,c,l).
% 23.73/23.91  colinear(d,e,f,m).
% 23.73/23.91  colinear(b,f,g,n).
% 23.73/23.91  colinear(c,e,g,o).
% 23.73/23.91  colinear(b,d,h,p).
% 23.73/23.91  colinear(a,e,h,q).
% 23.73/23.91  colinear(c,d,i,r).
% 23.73/23.91  colinear(a,f,i,s).
% 23.73/23.91  line_e_qual(n,o)->goal.
% 23.73/23.91  line_e_qual(p,q)->goal.
% 23.73/23.91  line_e_qual(s,r)->goal.
% 23.73/23.91  all A (line_e_qual(A,A)&incident(g,A)&incident(h,A)&incident(i,A)->goal).
% 23.73/23.91  all A B C D (colinear(A,B,C,D)->incident(A,D)).
% 23.73/23.91  all A B C D (colinear(A,B,C,D)->incident(B,D)).
% 23.73/23.91  all A B C D (colinear(A,B,C,D)->incident(C,D)).
% 23.73/23.91  all A B (incident(A,B)->point_e_qual(A,A)).
% 23.73/23.91  all A B (point_e_qual(A,B)->point_e_qual(B,A)).
% 23.73/23.91  all A B C (point_e_qual(A,B)&point_e_qual(B,C)->point_e_qual(A,C)).
% 23.73/23.91  all A B (incident(A,B)->line_e_qual(B,B)).
% 23.73/23.91  all A B (line_e_qual(A,B)->line_e_qual(B,A)).
% 23.73/23.91  all A B C (line_e_qual(A,B)&line_e_qual(B,C)->line_e_qual(A,C)).
% 23.73/23.91  all A B C (point_e_qual(A,B)&incident(B,C)->incident(A,C)).
% 23.73/23.91  all A B C (incident(A,B)&line_e_qual(B,C)->incident(A,C)).
% 23.73/23.91  all A B C D E F G H I J K L M N O P Q (colinear(A,B,C,J)&colinear(D,E,F,K)&colinear(B,F,G,L)&colinear(C,E,G,M)&colinear(B,D,H,N)&colinear(A,E,H,O)&colinear(C,D,I,P)&colinear(A,F,I,Q)-> (exists R colinear(G,H,I,R))|incident(A,K)|incident(B,K)|incident(C,K)|incident(D,J)|incident(E,J)|incident(F,J)).
% 23.73/23.91  all A B C D (incident(C,A)&incident(C,B)&incident(D,A)&incident(D,B)->point_e_qual(C,D)|line_e_qual(A,B)).
% 23.73/23.91  all A B (point_e_qual(A,A)&point_e_qual(B,B)-> (exists C (incident(A,C)&incident(B,C)))).
% 23.73/23.91  all A B C (line_e_qual(C,C)&line_e_qual(B,B)-> (exists A (incident(A,B)&incident(A,C)))).
% 23.73/23.91  -goal.
% 23.73/23.91  end_of_list.
% 23.73/23.91  
% 23.73/23.91  -------> usable clausifies to:
% 23.73/23.91  
% 23.73/23.91  list(usable).
% 23.73/23.91  0 [] colinear(a,b,c,l).
% 23.73/23.91  0 [] colinear(d,e,f,m).
% 23.73/23.91  0 [] colinear(b,f,g,n).
% 23.73/23.91  0 [] colinear(c,e,g,o).
% 23.73/23.91  0 [] colinear(b,d,h,p).
% 23.73/23.91  0 [] colinear(a,e,h,q).
% 23.73/23.91  0 [] colinear(c,d,i,r).
% 23.73/23.91  0 [] colinear(a,f,i,s).
% 23.73/23.91  0 [] -line_e_qual(n,o)|goal.
% 23.73/23.91  0 [] -line_e_qual(p,q)|goal.
% 23.73/23.91  0 [] -line_e_qual(s,r)|goal.
% 23.73/23.91  0 [] -line_e_qual(A,A)| -incident(g,A)| -incident(h,A)| -incident(i,A)|goal.
% 23.73/23.91  0 [] -colinear(A,B,C,D)|incident(A,D).
% 23.73/23.91  0 [] -colinear(A,B,C,D)|incident(B,D).
% 23.73/23.91  0 [] -colinear(A,B,C,D)|incident(C,D).
% 23.73/23.91  0 [] -incident(A,B)|point_e_qual(A,A).
% 23.73/23.91  0 [] -point_e_qual(A,B)|point_e_qual(B,A).
% 23.73/23.91  0 [] -point_e_qual(A,B)| -point_e_qual(B,C)|point_e_qual(A,C).
% 23.73/23.91  0 [] -incident(A,B)|line_e_qual(B,B).
% 23.73/23.91  0 [] -line_e_qual(A,B)|line_e_qual(B,A).
% 23.73/23.91  0 [] -line_e_qual(A,B)| -line_e_qual(B,C)|line_e_qual(A,C).
% 23.73/23.91  0 [] -point_e_qual(A,B)| -incident(B,C)|incident(A,C).
% 23.73/23.91  0 [] -incident(A,B)| -line_e_qual(B,C)|incident(A,C).
% 23.73/23.91  0 [] -colinear(A,B,C,J)| -colinear(D,E,F,K)| -colinear(B,F,G,L)| -colinear(C,E,G,M)| -colinear(B,D,H,N)| -colinear(A,E,H,O)| -colinear(C,D,I,P)| -colinear(A,F,I,Q)|colinear(G,H,I,$f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q))|incident(A,K)|incident(B,K)|incident(C,K)|incident(D,J)|incident(E,J)|incident(F,J).
% 23.73/23.91  0 [] -incident(C,A)| -incident(C,B)| -incident(D,A)| -incident(D,B)|point_e_qual(C,D)|line_e_qual(A,B).
% 23.73/23.91  0 [] -point_e_qual(A,A)| -point_e_qual(B,B)|incident(A,$f2(A,B)).
% 23.73/23.91  0 [] -point_e_qual(A,A)| -point_e_qual(B,B)|incident(B,$f2(A,B)).
% 23.73/23.91  0 [] -line_e_qual(C,C)| -line_e_qual(B,B)|incident($f3(A,B,C),B).
% 23.73/23.91  0 [] -line_e_qual(C,C)| -line_e_qual(B,B)|incident($f3(A,B,C),C).
% 23.73/23.91  0 [] -goal.
% 23.73/23.91  end_of_list.
% 23.73/23.91  
% 23.73/23.91  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=15.
% 23.73/23.91  
% 23.73/23.91  This is a non-Horn set without equality.  The strategy will
% 23.73/23.91  be ordered hyper_res, unit deletion, and factoring, with
% 23.73/23.91  satellites in sos and with nuclei in usable.
% 23.73/23.91  
% 23.73/23.91     dependent: set(hyper_res).
% 23.73/23.91     dependent: set(factor).
% 23.73/23.91     dependent: set(unit_deletion).
% 23.73/23.91  
% 23.73/23.91  ------------> process usaAlarm clock 
% 299.87/300.04  Otter interrupted
% 299.87/300.04  PROOF NOT FOUND
%------------------------------------------------------------------------------