TSTP Solution File: GEO024-3 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GEO024-3 : TPTP v8.1.0. Released v1.0.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:53:20 EDT 2022

% Result   : Unsatisfiable 0.46s 1.01s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO024-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun 18 14:38:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.46/1.01  ============================== Prover9 ===============================
% 0.46/1.01  Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.01  Process 7856 was started by sandbox2 on n016.cluster.edu,
% 0.46/1.01  Sat Jun 18 14:38:38 2022
% 0.46/1.01  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7703_n016.cluster.edu".
% 0.46/1.01  ============================== end of head ===========================
% 0.46/1.01  
% 0.46/1.01  ============================== INPUT =================================
% 0.46/1.01  
% 0.46/1.01  % Reading from file /tmp/Prover9_7703_n016.cluster.edu
% 0.46/1.01  
% 0.46/1.01  set(prolog_style_variables).
% 0.46/1.01  set(auto2).
% 0.46/1.01      % set(auto2) -> set(auto).
% 0.46/1.01      % set(auto) -> set(auto_inference).
% 0.46/1.01      % set(auto) -> set(auto_setup).
% 0.46/1.01      % set(auto_setup) -> set(predicate_elim).
% 0.46/1.01      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.01      % set(auto) -> set(auto_limits).
% 0.46/1.01      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.01      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.01      % set(auto) -> set(auto_denials).
% 0.46/1.01      % set(auto) -> set(auto_process).
% 0.46/1.01      % set(auto2) -> assign(new_constants, 1).
% 0.46/1.01      % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.01      % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.01      % set(auto2) -> assign(max_hours, 1).
% 0.46/1.01      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.01      % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.01      % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.01      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.01      % set(auto2) -> set(sort_initial_sos).
% 0.46/1.01      % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.01      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.01      % set(auto2) -> assign(max_megs, 400).
% 0.46/1.01      % set(auto2) -> assign(stats, some).
% 0.46/1.01      % set(auto2) -> clear(echo_input).
% 0.46/1.01      % set(auto2) -> set(quiet).
% 0.46/1.01      % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.01      % set(auto2) -> clear(print_given).
% 0.46/1.01  assign(lrs_ticks,-1).
% 0.46/1.01  assign(sos_limit,10000).
% 0.46/1.01  assign(order,kbo).
% 0.46/1.01  set(lex_order_vars).
% 0.46/1.01  clear(print_given).
% 0.46/1.01  
% 0.46/1.01  % formulas(sos).  % not echoed (36 formulas)
% 0.46/1.01  
% 0.46/1.01  ============================== end of input ==========================
% 0.46/1.01  
% 0.46/1.01  % From the command line: assign(max_seconds, 300).
% 0.46/1.01  
% 0.46/1.01  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.01  
% 0.46/1.01  % Formulas that are not ordinary clauses:
% 0.46/1.01  
% 0.46/1.01  ============================== end of process non-clausal formulas ===
% 0.46/1.01  
% 0.46/1.01  ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.01  
% 0.46/1.01  ============================== PREDICATE ELIMINATION =================
% 0.46/1.01  
% 0.46/1.01  ============================== end predicate elimination =============
% 0.46/1.01  
% 0.46/1.01  Auto_denials:  (non-Horn, no changes).
% 0.46/1.01  
% 0.46/1.01  Term ordering decisions:
% 0.46/1.01  Function symbol KB weights:  lower_dimension_point_1=1. lower_dimension_point_2=1. lower_dimension_point_3=1. u=1. v=1. reflection=1. extension=1. euclid1=1. euclid2=1. inner_pasch=1. continuous=1.
% 0.46/1.01  
% 0.46/1.01  ============================== end of process initial clauses ========
% 0.46/1.01  
% 0.46/1.01  ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.01  
% 0.46/1.01  ============================== end of clauses for search =============
% 0.46/1.01  
% 0.46/1.01  ============================== SEARCH ================================
% 0.46/1.01  
% 0.46/1.01  % Starting search at 0.01 seconds.
% 0.46/1.01  
% 0.46/1.01  ============================== PROOF =================================
% 0.46/1.01  % SZS status Unsatisfiable
% 0.46/1.01  % SZS output start Refutation
% 0.46/1.01  
% 0.46/1.01  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.46/1.01  % Length of proof is 6.
% 0.46/1.01  % Level of proof is 3.
% 0.46/1.01  % Maximum clause weight is 9.000.
% 0.46/1.01  % Given clauses 5.
% 0.46/1.01  
% 0.46/1.01  6 A = extension(B,A,C,C) # label(e1) # label(axiom).  [assumption].
% 0.46/1.01  7 extension(A,B,C,C) = B.  [copy(6),flip(a)].
% 0.46/1.01  10 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom).  [assumption].
% 0.46/1.01  15 -equidistant(u,u,v,v) # label(prove_congruence) # label(negated_conjecture).  [assumption].
% 0.46/1.01  61 equidistant(A,A,B,B).  [para(7(a,1),10(a,2))].
% 0.46/1.01  62 $F.  [resolve(61,a,15,a)].
% 0.46/1.01  
% 0.46/1.01  % SZS output end Refutation
% 0.46/1.01  ============================== end of proof ==========================
% 0.46/1.01  
% 0.46/1.01  ============================== STATISTICS ============================
% 0.46/1.01  
% 0.46/1.01  Given=5. Generated=83. Kept=56. proofs=1.
% 0.46/1.01  Usable=5. Sos=41. Demods=2. Limbo=0, Disabled=45. Hints=0.
% 0.46/1.01  Megabytes=0.09.
% 0.46/1.01  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.46/1.01  
% 0.46/1.01  ============================== end of statistics =====================
% 0.46/1.01  
% 0.46/1.01  ============================== end of search =========================
% 0.46/1.01  
% 0.46/1.01  THEOREM PROVED
% 0.46/1.01  % SZS status Unsatisfiable
% 0.46/1.01  
% 0.46/1.01  Exiting with 1 proof.
% 0.46/1.01  
% 0.46/1.01  Process 7856 exit (max_proofs) Sat Jun 18 14:38:38 2022
% 0.46/1.01  Prover9 interrupted
%------------------------------------------------------------------------------