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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GEO046-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n004.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:32 EDT 2022

% Result   : Unsatisfiable 10.74s 11.03s
% Output   : Refutation 10.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GEO046-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.33  % Computer : n004.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 16:53:23 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 10.74/11.03  ============================== Prover9 ===============================
% 10.74/11.03  Prover9 (32) version 2009-11A, November 2009.
% 10.74/11.03  Process 32360 was started by sandbox on n004.cluster.edu,
% 10.74/11.03  Fri Jun 17 16:53:24 2022
% 10.74/11.03  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32199_n004.cluster.edu".
% 10.74/11.03  ============================== end of head ===========================
% 10.74/11.03  
% 10.74/11.03  ============================== INPUT =================================
% 10.74/11.03  
% 10.74/11.03  % Reading from file /tmp/Prover9_32199_n004.cluster.edu
% 10.74/11.03  
% 10.74/11.03  set(prolog_style_variables).
% 10.74/11.03  set(auto2).
% 10.74/11.03      % set(auto2) -> set(auto).
% 10.74/11.03      % set(auto) -> set(auto_inference).
% 10.74/11.03      % set(auto) -> set(auto_setup).
% 10.74/11.03      % set(auto_setup) -> set(predicate_elim).
% 10.74/11.03      % set(auto_setup) -> assign(eq_defs, unfold).
% 10.74/11.03      % set(auto) -> set(auto_limits).
% 10.74/11.03      % set(auto_limits) -> assign(max_weight, "100.000").
% 10.74/11.03      % set(auto_limits) -> assign(sos_limit, 20000).
% 10.74/11.03      % set(auto) -> set(auto_denials).
% 10.74/11.03      % set(auto) -> set(auto_process).
% 10.74/11.03      % set(auto2) -> assign(new_constants, 1).
% 10.74/11.03      % set(auto2) -> assign(fold_denial_max, 3).
% 10.74/11.03      % set(auto2) -> assign(max_weight, "200.000").
% 10.74/11.03      % set(auto2) -> assign(max_hours, 1).
% 10.74/11.03      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 10.74/11.03      % set(auto2) -> assign(max_seconds, 0).
% 10.74/11.03      % set(auto2) -> assign(max_minutes, 5).
% 10.74/11.03      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 10.74/11.03      % set(auto2) -> set(sort_initial_sos).
% 10.74/11.03      % set(auto2) -> assign(sos_limit, -1).
% 10.74/11.03      % set(auto2) -> assign(lrs_ticks, 3000).
% 10.74/11.03      % set(auto2) -> assign(max_megs, 400).
% 10.74/11.03      % set(auto2) -> assign(stats, some).
% 10.74/11.03      % set(auto2) -> clear(echo_input).
% 10.74/11.03      % set(auto2) -> set(quiet).
% 10.74/11.03      % set(auto2) -> clear(print_initial_clauses).
% 10.74/11.03      % set(auto2) -> clear(print_given).
% 10.74/11.03  assign(lrs_ticks,-1).
% 10.74/11.03  assign(sos_limit,10000).
% 10.74/11.03  assign(order,kbo).
% 10.74/11.03  set(lex_order_vars).
% 10.74/11.03  clear(print_given).
% 10.74/11.03  
% 10.74/11.03  % formulas(sos).  % not echoed (58 formulas)
% 10.74/11.03  
% 10.74/11.03  ============================== end of input ==========================
% 10.74/11.03  
% 10.74/11.03  % From the command line: assign(max_seconds, 300).
% 10.74/11.03  
% 10.74/11.03  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 10.74/11.03  
% 10.74/11.03  % Formulas that are not ordinary clauses:
% 10.74/11.03  
% 10.74/11.03  ============================== end of process non-clausal formulas ===
% 10.74/11.03  
% 10.74/11.03  ============================== PROCESS INITIAL CLAUSES ===============
% 10.74/11.03  
% 10.74/11.03  ============================== PREDICATE ELIMINATION =================
% 10.74/11.03  
% 10.74/11.03  ============================== end predicate elimination =============
% 10.74/11.03  
% 10.74/11.03  Auto_denials:  (non-Horn, no changes).
% 10.74/11.03  
% 10.74/11.03  Term ordering decisions:
% 10.74/11.03  Function symbol KB weights:  v=1. x=1. u=1. w=1. lower_dimension_point_1=1. lower_dimension_point_2=1. lower_dimension_point_3=1. reflection=1. extension=1. euclid1=1. euclid2=1. inner_pasch=1. continuous=1.
% 10.74/11.03  
% 10.74/11.03  ============================== end of process initial clauses ========
% 10.74/11.03  
% 10.74/11.03  ============================== CLAUSES FOR SEARCH ====================
% 10.74/11.03  
% 10.74/11.03  ============================== end of clauses for search =============
% 10.74/11.03  
% 10.74/11.03  ============================== SEARCH ================================
% 10.74/11.03  
% 10.74/11.03  % Starting search at 0.02 seconds.
% 10.74/11.03  
% 10.74/11.03  ============================== PROOF =================================
% 10.74/11.03  % SZS status Unsatisfiable
% 10.74/11.03  % SZS output start Refutation
% 10.74/11.03  
% 10.74/11.03  % Proof 1 at 10.06 (+ 0.01) seconds.
% 10.74/11.03  % Length of proof is 43.
% 10.74/11.03  % Level of proof is 9.
% 10.74/11.03  % Maximum clause weight is 15.000.
% 10.74/11.03  % Given clauses 341.
% 10.74/11.03  
% 10.74/11.03  2 between(A,A,B) # label(t2) # label(axiom).  [assumption].
% 10.74/11.03  3 between(u,v,x) # label(v_between_u_and_x) # label(hypothesis).  [assumption].
% 10.74/11.03  4 between(v,w,x) # label(w_between_v_and_x) # label(hypothesis).  [assumption].
% 10.74/11.03  16 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom).  [assumption].
% 10.74/11.03  26 -between(u,w,x) # label(prove_w_between_u_and_x) # label(negated_conjecture).  [assumption].
% 10.74/11.03  33 -between(A,B,C) | between(C,B,A) # label(t1) # label(axiom).  [assumption].
% 10.74/11.03  41 A != extension(B,C,D,E) | between(B,C,A) # label(b0) # label(axiom).  [assumption].
% 10.74/11.03  42 extension(A,B,C,D) != E | between(A,B,E).  [copy(41),flip(a)].
% 10.74/11.03  43 -between(A,B,C) | A != C | between(D,B,C) # label(b1) # label(axiom).  [assumption].
% 10.74/11.03  46 -between(A,B,C) | -between(A,C,D) | between(B,C,D) # label(b5) # label(axiom).  [assumption].
% 10.74/11.03  47 -between(A,B,C) | A = B | C = extension(A,B,B,C) # label(d10_1) # label(axiom).  [assumption].
% 10.74/11.03  48 -between(A,B,C) | A = B | extension(A,B,B,C) = C.  [copy(47),flip(c)].
% 10.74/11.03  51 -between(A,B,C) | -between(B,C,D) | between(A,C,D) | B = C # label(b6) # label(axiom).  [assumption].
% 10.74/11.03  52 -between(A,B,C) | -between(B,C,D) | between(A,B,D) | B = C # label(b7) # label(axiom).  [assumption].
% 10.74/11.03  81 between(extension(A,B,C,D),B,A).  [resolve(33,a,16,a)].
% 10.74/11.03  82 between(x,w,v).  [resolve(33,a,4,a)].
% 10.74/11.03  83 between(x,v,u).  [resolve(33,a,3,a)].
% 10.74/11.03  84 -between(x,w,u).  [ur(33,b,26,a)].
% 10.74/11.03  108 w != x.  [ur(43,a,2,a,c,26,a)].
% 10.74/11.03  143 -between(A,v,w) | between(A,w,x) | w = v.  [resolve(51,b,4,a),flip(c)].
% 10.74/11.03  316 extension(x,w,w,v) = v.  [resolve(82,a,48,a),flip(a),unit_del(a,108)].
% 10.74/11.03  318 -between(x,v,A) | between(w,v,A).  [resolve(82,a,46,a)].
% 10.74/11.03  335 -between(v,u,A) | between(x,v,A) | u = v.  [resolve(83,a,52,a),flip(c)].
% 10.74/11.03  340 -between(x,u,A) | between(v,u,A).  [resolve(83,a,46,a)].
% 10.74/11.03  370 v != A | between(x,w,A).  [para(316(a,1),42(a,1))].
% 10.74/11.03  428 -between(extension(w,u,A,B),w,x).  [ur(46,a,81,a,c,26,a)].
% 10.74/11.03  456 u != v.  [ur(370,b,84,a),flip(a)].
% 10.74/11.03  459 -between(v,u,A) | between(x,v,A).  [back_unit_del(335),unit_del(c,456)].
% 10.74/11.03  596 between(w,v,u).  [resolve(318,a,83,a)].
% 10.74/11.03  612 -between(v,u,A) | between(w,v,A).  [resolve(596,a,52,a),flip(c),unit_del(c,456)].
% 10.74/11.03  614 -between(v,u,A) | between(w,u,A).  [resolve(596,a,51,a),flip(c),unit_del(c,456)].
% 10.74/11.03  617 -between(w,u,A) | between(v,u,A).  [resolve(596,a,46,a)].
% 10.74/11.03  692 between(v,u,extension(x,u,A,B)).  [resolve(340,a,16,a)].
% 10.74/11.03  999 between(v,u,extension(w,u,A,B)).  [resolve(617,a,16,a)].
% 10.74/11.03  1093 between(w,u,extension(x,u,A,B)).  [resolve(692,a,614,a)].
% 10.74/11.03  1095 between(x,v,extension(x,u,A,B)).  [resolve(692,a,459,a)].
% 10.74/11.03  1544 between(w,v,extension(w,u,A,B)).  [resolve(999,a,612,a)].
% 10.74/11.03  1753 between(extension(x,u,A,B),u,w).  [resolve(1093,a,33,a)].
% 10.74/11.03  1844 between(extension(x,u,A,B),v,x).  [resolve(1095,a,33,a)].
% 10.74/11.03  1994 between(extension(w,u,A,B),v,w).  [resolve(1544,a,33,a)].
% 10.74/11.03  2173 -between(extension(x,u,A,B),w,x).  [ur(46,a,1753,a,c,26,a)].
% 10.74/11.03  3092 w = v.  [resolve(143,a,1994,a),unit_del(a,428)].
% 10.74/11.03  3213 $F.  [back_rewrite(2173),rewrite([3092(4)]),unit_del(a,1844)].
% 10.74/11.03  
% 10.74/11.03  % SZS output end Refutation
% 10.74/11.03  ============================== end of proof ==========================
% 10.74/11.03  
% 10.74/11.03  ============================== STATISTICS ============================
% 10.74/11.03  
% 10.74/11.03  Given=341. Generated=13559. Kept=3203. proofs=1.
% 10.74/11.03  Usable=316. Sos=2037. Demods=39. Limbo=121, Disabled=787. Hints=0.
% 10.74/11.03  Megabytes=3.03.
% 10.74/11.03  User_CPU=10.06, System_CPU=0.01, Wall_clock=10.
% 10.74/11.03  
% 10.74/11.03  ============================== end of statistics =====================
% 10.74/11.03  
% 10.74/11.03  ============================== end of search =========================
% 10.74/11.03  
% 10.74/11.03  THEOREM PROVED
% 10.74/11.03  % SZS status Unsatisfiable
% 10.74/11.03  
% 10.74/11.03  Exiting with 1 proof.
% 10.74/11.03  
% 10.74/11.03  Process 32360 exit (max_proofs) Fri Jun 17 16:53:34 2022
% 10.74/11.03  Prover9 interrupted
%------------------------------------------------------------------------------