TSTP Solution File: GEO028-2 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GEO028-2 : 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:21 EDT 2022

% Result   : Unsatisfiable 0.91s 1.16s
% Output   : Refutation 0.91s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO028-2 : 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 15:21:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.91/1.16  ============================== Prover9 ===============================
% 0.91/1.16  Prover9 (32) version 2009-11A, November 2009.
% 0.91/1.16  Process 15371 was started by sandbox on n016.cluster.edu,
% 0.91/1.16  Sat Jun 18 15:21:38 2022
% 0.91/1.16  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15217_n016.cluster.edu".
% 0.91/1.16  ============================== end of head ===========================
% 0.91/1.16  
% 0.91/1.16  ============================== INPUT =================================
% 0.91/1.16  
% 0.91/1.16  % Reading from file /tmp/Prover9_15217_n016.cluster.edu
% 0.91/1.16  
% 0.91/1.16  set(prolog_style_variables).
% 0.91/1.16  set(auto2).
% 0.91/1.16      % set(auto2) -> set(auto).
% 0.91/1.16      % set(auto) -> set(auto_inference).
% 0.91/1.16      % set(auto) -> set(auto_setup).
% 0.91/1.16      % set(auto_setup) -> set(predicate_elim).
% 0.91/1.16      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.91/1.16      % set(auto) -> set(auto_limits).
% 0.91/1.16      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.91/1.16      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.91/1.16      % set(auto) -> set(auto_denials).
% 0.91/1.16      % set(auto) -> set(auto_process).
% 0.91/1.16      % set(auto2) -> assign(new_constants, 1).
% 0.91/1.16      % set(auto2) -> assign(fold_denial_max, 3).
% 0.91/1.16      % set(auto2) -> assign(max_weight, "200.000").
% 0.91/1.16      % set(auto2) -> assign(max_hours, 1).
% 0.91/1.16      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.91/1.16      % set(auto2) -> assign(max_seconds, 0).
% 0.91/1.16      % set(auto2) -> assign(max_minutes, 5).
% 0.91/1.16      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.91/1.16      % set(auto2) -> set(sort_initial_sos).
% 0.91/1.16      % set(auto2) -> assign(sos_limit, -1).
% 0.91/1.16      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.91/1.16      % set(auto2) -> assign(max_megs, 400).
% 0.91/1.16      % set(auto2) -> assign(stats, some).
% 0.91/1.16      % set(auto2) -> clear(echo_input).
% 0.91/1.16      % set(auto2) -> set(quiet).
% 0.91/1.16      % set(auto2) -> clear(print_initial_clauses).
% 0.91/1.16      % set(auto2) -> clear(print_given).
% 0.91/1.16  assign(lrs_ticks,-1).
% 0.91/1.16  assign(sos_limit,10000).
% 0.91/1.16  assign(order,kbo).
% 0.91/1.16  set(lex_order_vars).
% 0.91/1.16  clear(print_given).
% 0.91/1.16  
% 0.91/1.16  % formulas(sos).  % not echoed (21 formulas)
% 0.91/1.16  
% 0.91/1.16  ============================== end of input ==========================
% 0.91/1.16  
% 0.91/1.16  % From the command line: assign(max_seconds, 300).
% 0.91/1.16  
% 0.91/1.16  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.91/1.16  
% 0.91/1.16  % Formulas that are not ordinary clauses:
% 0.91/1.16  
% 0.91/1.16  ============================== end of process non-clausal formulas ===
% 0.91/1.16  
% 0.91/1.16  ============================== PROCESS INITIAL CLAUSES ===============
% 0.91/1.16  
% 0.91/1.16  ============================== PREDICATE ELIMINATION =================
% 0.91/1.16  
% 0.91/1.16  ============================== end predicate elimination =============
% 0.91/1.16  
% 0.91/1.16  Auto_denials:  (non-Horn, no changes).
% 0.91/1.16  
% 0.91/1.16  Term ordering decisions:
% 0.91/1.16  Function symbol KB weights:  w=1. x=1. y=1. z=1. lower_dimension_point_1=1. lower_dimension_point_2=1. lower_dimension_point_3=1. u=1. v=1. extension=1. euclid1=1. euclid2=1. inner_pasch=1. continuous=1.
% 0.91/1.16  
% 0.91/1.16  ============================== end of process initial clauses ========
% 0.91/1.16  
% 0.91/1.16  ============================== CLAUSES FOR SEARCH ====================
% 0.91/1.16  
% 0.91/1.16  ============================== end of clauses for search =============
% 0.91/1.16  
% 0.91/1.16  ============================== SEARCH ================================
% 0.91/1.16  
% 0.91/1.16  % Starting search at 0.01 seconds.
% 0.91/1.16  
% 0.91/1.16  ============================== PROOF =================================
% 0.91/1.16  % SZS status Unsatisfiable
% 0.91/1.16  % SZS output start Refutation
% 0.91/1.16  
% 0.91/1.16  % Proof 1 at 0.20 (+ 0.00) seconds.
% 0.91/1.16  % Length of proof is 22.
% 0.91/1.16  % Level of proof is 5.
% 0.91/1.16  % Maximum clause weight is 36.000.
% 0.91/1.16  % Given clauses 80.
% 0.91/1.16  
% 0.91/1.16  1 equidistant(A,B,B,A) # label(reflexivity_for_equidistance) # label(axiom).  [assumption].
% 0.91/1.16  2 equidistant(w,x,y,z) # label(w_to_x_equals_y_to_z) # label(hypothesis).  [assumption].
% 0.91/1.16  3 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom).  [assumption].
% 0.91/1.16  4 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom).  [assumption].
% 0.91/1.16  5 u != v # label(u_not_v) # label(hypothesis).  [assumption].
% 0.91/1.16  6 v != u.  [copy(5),flip(a)].
% 0.91/1.16  10 extension(u,v,w,x) != extension(u,v,y,z) # label(prove_equal_extensions) # label(negated_conjecture).  [assumption].
% 0.91/1.16  11 extension(u,v,y,z) != extension(u,v,w,x).  [copy(10),flip(a)].
% 0.91/1.16  13 -equidistant(A,B,C,C) | A = B # label(identity_for_equidistance) # label(axiom).  [assumption].
% 0.91/1.16  14 -equidistant(A,B,C,D) | -equidistant(A,B,E,F) | equidistant(C,D,E,F) # label(transitivity_for_equidistance) # label(axiom).  [assumption].
% 0.91/1.16  23 -equidistant(A,B,C,D) | -equidistant(B,E,D,F) | -equidistant(A,V6,C,V7) | -equidistant(B,V6,D,V7) | -between(A,B,E) | -between(C,D,F) | A = B | equidistant(E,V6,F,V7) # label(outer_five_segment) # label(axiom).  [assumption].
% 0.91/1.16  24 -equidistant(A,B,C,D) | equidistant(C,D,C,D).  [factor(14,a,b)].
% 0.91/1.16  46 -equidistant(extension(u,v,y,z),extension(u,v,w,x),A,A).  [ur(13,b,11,a)].
% 0.91/1.16  51 -equidistant(w,x,A,B) | equidistant(y,z,A,B).  [resolve(14,a,2,a)].
% 0.91/1.16  52 -equidistant(A,B,C,D) | equidistant(B,A,C,D).  [resolve(14,a,1,a)].
% 0.91/1.16  55 -equidistant(A,B,C,D) | equidistant(C,D,B,A).  [resolve(14,b,1,a)].
% 0.91/1.16  107 equidistant(A,B,A,B).  [resolve(24,a,4,a)].
% 0.91/1.16  222 -equidistant(v,extension(u,v,y,z),v,extension(u,v,w,x)).  [ur(23,a,107,a,c,107,a,d,107,a,e,3,a,f,3,a,g,6,a(flip),h,46,a)].
% 0.91/1.16  238 equidistant(extension(A,B,C,D),B,C,D).  [resolve(52,a,4,a)].
% 0.91/1.16  289 equidistant(A,B,C,extension(D,C,A,B)).  [resolve(55,a,238,a)].
% 0.91/1.16  320 equidistant(y,z,A,extension(B,A,w,x)).  [resolve(289,a,51,a)].
% 0.91/1.16  336 $F.  [ur(14,a,289,a,c,222,a),unit_del(a,320)].
% 0.91/1.16  
% 0.91/1.16  % SZS output end Refutation
% 0.91/1.16  ============================== end of proof ==========================
% 0.91/1.16  
% 0.91/1.16  ============================== STATISTICS ============================
% 0.91/1.16  
% 0.91/1.16  Given=80. Generated=917. Kept=333. proofs=1.
% 0.91/1.16  Usable=71. Sos=176. Demods=2. Limbo=19, Disabled=88. Hints=0.
% 0.91/1.16  Megabytes=0.36.
% 0.91/1.16  User_CPU=0.20, System_CPU=0.00, Wall_clock=0.
% 0.91/1.16  
% 0.91/1.16  ============================== end of statistics =====================
% 0.91/1.16  
% 0.91/1.16  ============================== end of search =========================
% 0.91/1.16  
% 0.91/1.16  THEOREM PROVED
% 0.91/1.16  % SZS status Unsatisfiable
% 0.91/1.16  
% 0.91/1.16  Exiting with 1 proof.
% 0.91/1.16  
% 0.91/1.16  Process 15371 exit (max_proofs) Sat Jun 18 15:21:38 2022
% 0.91/1.16  Prover9 interrupted
%------------------------------------------------------------------------------