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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GEO224+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n024.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:17 EDT 2022

% Result   : Timeout 300.02s 300.33s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GEO224+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n024.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  : 600
% 0.12/0.33  % DateTime : Sat Jun 18 15:11:17 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.69/0.98  ============================== Prover9 ===============================
% 0.69/0.98  Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.98  Process 11678 was started by sandbox2 on n024.cluster.edu,
% 0.69/0.98  Sat Jun 18 15:11:18 2022
% 0.69/0.98  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11525_n024.cluster.edu".
% 0.69/0.98  ============================== end of head ===========================
% 0.69/0.98  
% 0.69/0.98  ============================== INPUT =================================
% 0.69/0.98  
% 0.69/0.98  % Reading from file /tmp/Prover9_11525_n024.cluster.edu
% 0.69/0.98  
% 0.69/0.98  set(prolog_style_variables).
% 0.69/0.98  set(auto2).
% 0.69/0.98      % set(auto2) -> set(auto).
% 0.69/0.98      % set(auto) -> set(auto_inference).
% 0.69/0.98      % set(auto) -> set(auto_setup).
% 0.69/0.98      % set(auto_setup) -> set(predicate_elim).
% 0.69/0.98      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.98      % set(auto) -> set(auto_limits).
% 0.69/0.98      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.98      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.98      % set(auto) -> set(auto_denials).
% 0.69/0.98      % set(auto) -> set(auto_process).
% 0.69/0.98      % set(auto2) -> assign(new_constants, 1).
% 0.69/0.98      % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.98      % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.98      % set(auto2) -> assign(max_hours, 1).
% 0.69/0.98      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.98      % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.98      % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.98      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.98      % set(auto2) -> set(sort_initial_sos).
% 0.69/0.98      % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.98      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.98      % set(auto2) -> assign(max_megs, 400).
% 0.69/0.98      % set(auto2) -> assign(stats, some).
% 0.69/0.98      % set(auto2) -> clear(echo_input).
% 0.69/0.98      % set(auto2) -> set(quiet).
% 0.69/0.98      % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.98      % set(auto2) -> clear(print_given).
% 0.69/0.98  assign(lrs_ticks,-1).
% 0.69/0.98  assign(sos_limit,10000).
% 0.69/0.98  assign(order,kbo).
% 0.69/0.98  set(lex_order_vars).
% 0.69/0.98  clear(print_given).
% 0.69/0.98  
% 0.69/0.98  % formulas(sos).  % not echoed (25 formulas)
% 0.69/0.98  
% 0.69/0.98  ============================== end of input ==========================
% 0.69/0.98  
% 0.69/0.98  % From the command line: assign(max_seconds, 300).
% 0.69/0.98  
% 0.69/0.98  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.98  
% 0.69/0.98  % Formulas that are not ordinary clauses:
% 0.69/0.98  1 (all X -distinct_points(X,X)) # label(apart1) # label(axiom) # label(non_clause).  [assumption].
% 0.69/0.98  2 (all X -distinct_lines(X,X)) # label(apart2) # label(axiom) # label(non_clause).  [assumption].
% 0.69/0.98  3 (all X -convergent_lines(X,X)) # label(apart3) # label(axiom) # label(non_clause).  [assumption].
% 0.69/0.98  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.69/0.98  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.69/0.98  6 (all X all Y all Z (convergent_lines(X,Y) -> convergent_lines(X,Z) | convergent_lines(Y,Z))) # label(apart6) # label(axiom) # label(non_clause).  [assumption].
% 0.69/0.98  7 (all X all Y all Z (distinct_points(X,Y) -> (apart_point_and_line(Z,line_connecting(X,Y)) -> distinct_points(Z,X) & distinct_points(Z,Y)))) # label(con1) # label(axiom) # label(non_clause).  [assumption].
% 0.69/0.98  8 (all X all Y all Z (convergent_lines(X,Y) -> (apart_point_and_line(Z,X) | apart_point_and_line(Z,Y) -> distinct_points(Z,intersection_point(X,Y))))) # label(con2) # label(axiom) # label(non_clause).  [assumption].
% 0.69/0.98  9 (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.69/0.98  10 (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.69/0.98  11 (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].
% 0.69/0.98  12 (all X all Y (convergent_lines(X,Y) -> distinct_lines(X,Y))) # label(ceq3) # label(axiom) # label(non_clause).  [assumption].
% 0.69/0.98  13 (all X all Y -convergent_lines(parallel_througCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------