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

View Problem - Process Solution

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

% Computer : n012.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:54:31 EDT 2022

% Result   : Timeout 300.03s 300.30s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : GEO169+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.36  % Computer : n012.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Fri Jun 17 16:17:53 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.48/1.05  ============================== Prover9 ===============================
% 0.48/1.05  Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.05  Process 7223 was started by sandbox on n012.cluster.edu,
% 0.48/1.05  Fri Jun 17 16:17:54 2022
% 0.48/1.05  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7069_n012.cluster.edu".
% 0.48/1.05  ============================== end of head ===========================
% 0.48/1.05  
% 0.48/1.05  ============================== INPUT =================================
% 0.48/1.05  
% 0.48/1.05  % Reading from file /tmp/Prover9_7069_n012.cluster.edu
% 0.48/1.05  
% 0.48/1.05  set(prolog_style_variables).
% 0.48/1.05  set(auto2).
% 0.48/1.05      % set(auto2) -> set(auto).
% 0.48/1.05      % set(auto) -> set(auto_inference).
% 0.48/1.05      % set(auto) -> set(auto_setup).
% 0.48/1.05      % set(auto_setup) -> set(predicate_elim).
% 0.48/1.05      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.05      % set(auto) -> set(auto_limits).
% 0.48/1.05      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.05      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.05      % set(auto) -> set(auto_denials).
% 0.48/1.05      % set(auto) -> set(auto_process).
% 0.48/1.05      % set(auto2) -> assign(new_constants, 1).
% 0.48/1.05      % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.05      % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.05      % set(auto2) -> assign(max_hours, 1).
% 0.48/1.05      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.05      % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.05      % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.05      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.05      % set(auto2) -> set(sort_initial_sos).
% 0.48/1.05      % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.05      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.05      % set(auto2) -> assign(max_megs, 400).
% 0.48/1.05      % set(auto2) -> assign(stats, some).
% 0.48/1.05      % set(auto2) -> clear(echo_input).
% 0.48/1.05      % set(auto2) -> set(quiet).
% 0.48/1.05      % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.05      % set(auto2) -> clear(print_given).
% 0.48/1.05  assign(lrs_ticks,-1).
% 0.48/1.05  assign(sos_limit,10000).
% 0.48/1.05  assign(order,kbo).
% 0.48/1.05  set(lex_order_vars).
% 0.48/1.05  clear(print_given).
% 0.48/1.05  
% 0.48/1.05  % formulas(sos).  % not echoed (53 formulas)
% 0.48/1.05  
% 0.48/1.05  ============================== end of input ==========================
% 0.48/1.05  
% 0.48/1.05  % From the command line: assign(max_seconds, 300).
% 0.48/1.05  
% 0.48/1.05  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.05  
% 0.48/1.05  % Formulas that are not ordinary clauses:
% 0.48/1.05  1 (all A (incident(p3,A) & incident(p1,A) & incident(p2,A) -> goal)) # label(goal_normal) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  2 incident(a1,b2b3) & incident(a2,b3b1) & incident(a3,b1b2) -> goal # label(t_a_in_b) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  3 incident(b1,a2a3) & incident(b2,a3a1) & incident(b3,a1a2) -> goal # label(t_b_in_a) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  4 (all A all B (incident(A,B) -> point(A))) # label(sort_point) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  5 (all A all B (incident(A,B) -> line(B))) # label(sort_line) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  6 a1 = a2 -> goal # label(diff_a1_a2) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  7 a2 = a3 -> goal # label(diff_a2_a3) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  8 a3 = a1 -> goal # label(diff_a3_a1) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  9 b1 = b2 -> goal # label(diff_b1_b2) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  10 b2 = b3 -> goal # label(diff_b2_b3) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  11 b3 = b1 -> goal # label(diff_b3_b1) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  12 a1a2 = b1b2 -> goal # label(not12) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  13 a2a3 = b2b3 -> goal # label(not23) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  14 a3a1 = b3b1 -> goal # label(not31) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  15 (all A A = A) # label(reflexivity_of_equal) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  16 (all A all B (A = B -> B = A)) # label(symmetry_of_equal) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  17 (all A all B all C (A = B & B = C -> A = C)) # label(transitivity_of_equal) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  18 (all A all B all C (A = B & incident(B,C) -> incident(A,C))) # label(point_congruence) # label(axiom) # label(non_clause).  [assumption].
% 0.48/1.05  19 (all A all B all C (incident(A,B) &Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------