TSTP Solution File: GEO224+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GEO224+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %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  : 600s
% DateTime : Sat Jul 16 05:55:16 EDT 2022

% Result   : Timeout 300.05s 300.31s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO224+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.33  % Computer : n016.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Fri Jun 17 20:35:51 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.43/0.97  ============================== Prover9 ===============================
% 0.43/0.97  Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.97  Process 15295 was started by sandbox on n016.cluster.edu,
% 0.43/0.97  Fri Jun 17 20:35:51 2022
% 0.43/0.97  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15141_n016.cluster.edu".
% 0.43/0.97  ============================== end of head ===========================
% 0.43/0.97  
% 0.43/0.97  ============================== INPUT =================================
% 0.43/0.97  
% 0.43/0.97  % Reading from file /tmp/Prover9_15141_n016.cluster.edu
% 0.43/0.97  
% 0.43/0.97  set(prolog_style_variables).
% 0.43/0.97  set(auto2).
% 0.43/0.97      % set(auto2) -> set(auto).
% 0.43/0.97      % set(auto) -> set(auto_inference).
% 0.43/0.97      % set(auto) -> set(auto_setup).
% 0.43/0.97      % set(auto_setup) -> set(predicate_elim).
% 0.43/0.97      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.97      % set(auto) -> set(auto_limits).
% 0.43/0.97      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.97      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.97      % set(auto) -> set(auto_denials).
% 0.43/0.97      % set(auto) -> set(auto_process).
% 0.43/0.97      % set(auto2) -> assign(new_constants, 1).
% 0.43/0.97      % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.97      % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.97      % set(auto2) -> assign(max_hours, 1).
% 0.43/0.97      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.97      % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.97      % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.97      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.97      % set(auto2) -> set(sort_initial_sos).
% 0.43/0.97      % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.97      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.97      % set(auto2) -> assign(max_megs, 400).
% 0.43/0.97      % set(auto2) -> assign(stats, some).
% 0.43/0.97      % set(auto2) -> clear(echo_input).
% 0.43/0.97      % set(auto2) -> set(quiet).
% 0.43/0.97      % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.97      % set(auto2) -> clear(print_given).
% 0.43/0.97  assign(lrs_ticks,-1).
% 0.43/0.97  assign(sos_limit,10000).
% 0.43/0.97  assign(order,kbo).
% 0.43/0.97  set(lex_order_vars).
% 0.43/0.97  clear(print_given).
% 0.43/0.97  
% 0.43/0.97  % formulas(sos).  % not echoed (27 formulas)
% 0.43/0.97  
% 0.43/0.97  ============================== end of input ==========================
% 0.43/0.97  
% 0.43/0.97  % From the command line: assign(max_seconds, 300).
% 0.43/0.97  
% 0.43/0.97  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.97  
% 0.43/0.97  % Formulas that are not ordinary clauses:
% 0.43/0.97  1 (all X -distinct_points(X,X)) # label(apart1) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  2 (all X -distinct_lines(X,X)) # label(apart2) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  3 (all X -convergent_lines(X,X)) # label(apart3) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  4 (all X all Y all Z (distinct_points(X,Y) -> distinct_points(X,Z) | distinct_points(Y,Z))) # label(apart4) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  5 (all X all Y all Z (distinct_lines(X,Y) -> distinct_lines(X,Z) | distinct_lines(Y,Z))) # label(apart5) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  6 (all X all Y all Z (convergent_lines(X,Y) -> convergent_lines(X,Z) | convergent_lines(Y,Z))) # label(ax6) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  7 (all X all Y (distinct_points(X,Y) -> -apart_point_and_line(X,line_connecting(X,Y)))) # label(ci1) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  8 (all X all Y (distinct_points(X,Y) -> -apart_point_and_line(Y,line_connecting(X,Y)))) # label(ci2) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  9 (all X all Y (convergent_lines(X,Y) -> -apart_point_and_line(intersection_point(X,Y),X))) # label(ci3) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  10 (all X all Y (convergent_lines(X,Y) -> -apart_point_and_line(intersection_point(X,Y),Y))) # label(ci4) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  11 (all X all Y all U all V (distinct_points(X,Y) & distinct_lines(U,V) -> apart_point_and_line(X,U) | apart_point_and_line(X,V) | apart_point_and_line(Y,U) | apart_point_and_line(Y,V))) # label(cu1) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  12 (all X all Y all Z (apart_point_and_line(X,Y) -> distinct_points(X,Z) | apart_point_and_line(Z,Y))) # label(ceq1) # label(axiom) # label(non_clause).  [assumption].
% 0.43/0.97  13 (all X all Y all Z (apart_point_and_line(X,Y) -> distinct_lines(Y,Z) | apart_point_and_line(X,Z))) # label(ceq2) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  14 (all X all Y all Z (convergent_lines(X,Y) -> distinct_lines(Y,Z) | convergent_lines(X,Z))) # label(ceq3) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  15 (all X all Y -convergent_lines(parallel_through_point(Y,X),Y)) # label(cp1) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  16 (all X all Y -apart_point_and_line(X,parallel_through_point(Y,X))) # label(cp2) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  17 (all X all Y all Z (distinct_lines(Y,Z) -> apart_point_and_line(X,Y) | apart_point_and_line(X,Z) | convergent_lines(Y,Z))) # label(cup1) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  18 (all L all M (convergent_lines(L,M) | unorthogonal_lines(L,M))) # label(occu1) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  19 (all L all M all N (convergent_lines(L,M) & unorthogonal_lines(L,M) -> convergent_lines(L,N) & unorthogonal_lines(L,N) | convergent_lines(M,N) & unorthogonal_lines(M,N))) # label(oac1) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  20 (all A all L -unorthogonal_lines(orthogonal_through_point(L,A),L)) # label(ooc1) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  21 (all A all L -apart_point_and_line(A,orthogonal_through_point(L,A))) # label(ooc2) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  22 (all A all L all M all N (distinct_lines(L,M) -> apart_point_and_line(A,L) | apart_point_and_line(A,M) | unorthogonal_lines(L,N) | unorthogonal_lines(M,N))) # label(ouo1) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  23 (all A all B (point(A) & point(B) & distinct_points(A,B) -> line(line_connecting(A,B)))) # label(con1) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  24 (all L all M (line(L) & line(M) & convergent_lines(L,M) -> point(intersection_point(L,M)))) # label(int1) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  25 (all L all A (line(L) & point(A) -> line(parallel_through_point(L,A)))) # label(par1) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  26 (all L all A (line(L) & point(A) -> line(orthogonal_through_point(L,A)))) # label(orth1) # label(axiom) # label(non_clause).  [assumption].
% 60.19/60.43  27 -(all X all Y (point(X) & line(Y) -> (exists Z (point(Z) & -apt(Z,Y))))) # label(con) # label(negated_conjecture) # label(non_clause).  [assumption].
% 60.19/60.43  
% 60.19/60.43  ============================== end of process non-clausal formulas ===
% 60.19/60.43  
% 60.19/60.43  ============================== PROCESS INITIAL CLAUSES ===============
% 60.19/60.43  
% 60.19/60.43  ============================== PREDICATE ELIMINATION =================
% 60.19/60.43  
% 60.19/60.43  ============================== end predicate elimination =============
% 60.19/60.43  
% 60.19/60.43  Auto_denials:  (non-Horn, no changes).
% 60.19/60.43  
% 60.19/60.43  Term ordering decisions:
% 60.19/60.43  Function symbol KB weights:  c1=1. c2=1. intersection_point=1. line_connecting=1. orthogonal_through_point=1. parallel_through_point=1.
% 60.19/60.43  
% 60.19/60.43  ============================== end of process initial clauses ========
% 60.19/60.43  
% 60.19/60.43  ============================== CLAUSES FOR SEARCH ====================
% 60.19/60.43  
% 60.19/60.43  ============================== end of clauses for search =============
% 60.19/60.43  
% 60.19/60.43  ============================== SEARCH ================================
% 60.19/60.43  
% 60.19/60.43  % Starting search at 0.01 seconds.
% 60.19/60.43  
% 60.19/60.43  Low Water (keep): wt=41.000, iters=3610
% 60.19/60.44  
% 60.19/60.44  Low Water (keep): wt=39.000, iters=3558
% 60.19/60.44  
% 60.19/60.44  Low Water (keep): wt=37.000, iters=3364
% 60.19/60.44  
% 60.19/60.44  Low Water (keep): wt=35.000, iters=3366
% 60.19/60.44  
% 60.19/60.44  Low Water (keep): wt=33.000, iters=3358
% 60.19/60.44  
% 60.19/60.44  Low Water (keep): wt=31.000, iters=3476
% 60.19/60.44  
% 60.19/60.44  Low Water (keep): wt=27.000, iters=3394
% 60.19/60.44  
% 60.19/60.44  Low Water (keep): wt=25.000, iters=3389
% 60.19/60.44  
% 60.19/60.44  Low Water (keep): wt=23.000, iters=3434
% 60.19/60.44  
% 60.19/60.44  Low Water (keep): wt=21.000, iters=3389
% 60.19/60.44  
% 60.19/60.44  Low Water (keep): wt=19.000, iters=3346
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=2996, wt=57.000
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=3069, wt=55.000
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=2830, wt=51.000
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=10933, wt=46.000
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=10771, wt=45.000
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=10932, wt=36.000
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=11856, wt=33.000
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=10954, wt=30.000
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=11385, wt=29.000
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=11953, wt=17.000
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=12468, wt=15.000
% 60.19/60.44  
% 60.19/60.44  Low Water (keep): wt=17.000, iters=3334
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=13204, wt=14.000
% 60.19/60.44  
% 60.19/60.44  Low Water (displace): id=134Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------