TSTP Solution File: GEO078-4 by Prover9---1109a

View Problem - Process Solution

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

% Computer : n026.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:47 EDT 2022

% Result   : Timeout 300.04s 300.32s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO078-4 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n026.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 16:26:24 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.43/1.01  ============================== Prover9 ===============================
% 0.43/1.01  Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01  Process 28272 was started by sandbox on n026.cluster.edu,
% 0.43/1.01  Sat Jun 18 16:26:25 2022
% 0.43/1.01  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28119_n026.cluster.edu".
% 0.43/1.01  ============================== end of head ===========================
% 0.43/1.01  
% 0.43/1.01  ============================== INPUT =================================
% 0.43/1.01  
% 0.43/1.01  % Reading from file /tmp/Prover9_28119_n026.cluster.edu
% 0.43/1.01  
% 0.43/1.01  set(prolog_style_variables).
% 0.43/1.01  set(auto2).
% 0.43/1.01      % set(auto2) -> set(auto).
% 0.43/1.01      % set(auto) -> set(auto_inference).
% 0.43/1.01      % set(auto) -> set(auto_setup).
% 0.43/1.01      % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01      % set(auto) -> set(auto_limits).
% 0.43/1.01      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01      % set(auto) -> set(auto_denials).
% 0.43/1.01      % set(auto) -> set(auto_process).
% 0.43/1.01      % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01      % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01      % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01      % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01      % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01      % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01      % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01      % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01      % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01      % set(auto2) -> assign(stats, some).
% 0.43/1.01      % set(auto2) -> clear(echo_input).
% 0.43/1.01      % set(auto2) -> set(quiet).
% 0.43/1.01      % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01      % set(auto2) -> clear(print_given).
% 0.43/1.01  assign(lrs_ticks,-1).
% 0.43/1.01  assign(sos_limit,10000).
% 0.43/1.01  assign(order,kbo).
% 0.43/1.01  set(lex_order_vars).
% 0.43/1.01  clear(print_given).
% 0.43/1.01  
% 0.43/1.01  % formulas(sos).  % not echoed (33 formulas)
% 0.43/1.01  
% 0.43/1.01  ============================== end of input ==========================
% 0.43/1.01  
% 0.43/1.01  % From the command line: assign(max_seconds, 300).
% 0.43/1.01  
% 0.43/1.01  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01  
% 0.43/1.01  % Formulas that are not ordinary clauses:
% 0.43/1.01  
% 0.43/1.01  ============================== end of process non-clausal formulas ===
% 0.43/1.01  
% 0.43/1.01  ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01  
% 0.43/1.01  ============================== PREDICATE ELIMINATION =================
% 0.43/1.01  1 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | line(line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10D) # label(axiom).  [assumption].
% 0.43/1.01  2 plane(plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | collinear(A,B,C) | A = B | A = C | B = C # label(axiom_G7D) # label(axiom).  [assumption].
% 0.43/1.01  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | line(line_through_3_points(A,B,C)) | plane(plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(1,h,2,e)].
% 0.43/1.01  3 on(A,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | collinear(A,B,C) | A = B | A = C | B = C # label(axiom_G7A) # label(axiom).  [assumption].
% 0.43/1.01  Derived: on(A,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | line(line_through_3_points(A,B,C)).  [resolve(3,e,1,h)].
% 0.43/1.01  4 on(A,plane_for_points(B,A,C)) | -point(B) | -point(A) | -point(C) | collinear(B,A,C) | B = A | B = C | A = C # label(axiom_G7B) # label(axiom).  [assumption].
% 0.43/1.01  Derived: on(A,plane_for_points(B,A,C)) | -point(B) | -point(A) | -point(C) | B = A | B = C | A = C | -point(B) | -point(A) | -point(C) | B = A | B = C | A = C | line(line_through_3_points(B,A,C)).  [resolve(4,e,1,h)].
% 0.43/1.01  5 on(A,plane_for_points(B,C,A)) | -point(B) | -point(C) | -point(A) | collinear(B,C,A) | B = C | B = A | C = A # label(axiom_G7C) # label(axiom).  [assumption].
% 0.43/1.01  Derived: on(A,plane_for_points(B,C,A)) | -point(B) | -point(C) | -point(A) | B = C | B = A | C = A | -point(B) | -point(C) | -point(A) | B = C | B = A | C = A | line(line_through_3_points(B,C,A)).  [resolve(5,e,1,h)].
% 0.43/1.01  6 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10A) # label(axiom).  [assumption].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)) | plane(plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(6,h,2,e)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)) | on(A,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(6,h,3,e)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)) | on(B,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(6,h,4,e)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)) | on(C,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(6,h,5,e)].
% 0.73/1.07  7 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10B) # label(axiom).  [assumption].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)) | plane(plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(7,h,2,e)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)) | on(A,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(7,h,3,e)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)) | on(B,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(7,h,4,e)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)) | on(C,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(7,h,5,e)].
% 0.73/1.07  8 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10C) # label(axiom).  [assumption].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)) | plane(plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(8,h,2,e)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)) | on(A,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(8,h,3,e)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)) | on(B,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(8,h,4,e)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)) | on(C,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C.  [resolve(8,h,5,e)].
% 0.73/1.07  9 collinear(A,B,C) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,a_plane) | -on(B,a_plane) | -on(C,a_plane) # label(prove_every_plane_contains_3_noncollinear_points) # label(negated_conjecture).  [assumption].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,a_plane) | -on(B,a_plane) | -on(C,a_plane) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | line(line_through_3_points(A,B,C)).  [resolve(9,a,1,h)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,a_plane) | -on(B,a_plane) | -on(C,a_plane) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)).  [resolve(9,a,6,h)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,a_plane) | -on(B,a_plane) | -on(C,a_plane) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)).  [resolve(9,a,7,h)].
% 0.73/1.07  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,a_plane) | -on(B,a_plane) | -on(C,a_plane) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)).  [resolve(9,a,8,h)].
% 3.09/3.41  10 collinear(A,B,C) | -on(A,D) | -on(B,D) | -on(C,D) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -line(D) # label(axiom_G10E) # label(axiom).  [assumption].
% 3.09/3.41  Derived: -on(A,B) | -on(C,B) | -on(D,B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | -line(B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | line(line_through_3_points(A,C,D)).  [resolve(10,a,1,h)].
% 3.09/3.41  Derived: -on(A,B) | -on(C,B) | -on(D,B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | -line(B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | on(A,line_through_3_points(A,C,D)).  [resolve(10,a,6,h)].
% 3.09/3.41  Derived: -on(A,B) | -on(C,B) | -on(D,B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | -line(B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | on(C,line_through_3_points(A,C,D)).  [resolve(10,a,7,h)].
% 3.09/3.41  Derived: -on(A,B) | -on(C,B) | -on(D,B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | -line(B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | on(D,line_through_3_points(A,C,D)).  [resolve(10,a,8,h)].
% 3.09/3.41  11 -point(A) | -point(B) | -point(C) | collinear(A,B,C) | A = B | A = C | B = C | -on(A,D) | -on(B,D) | -on(C,D) | -plane(D) | -on(A,E) | -on(B,E) | -on(C,E) | -plane(E) | D = E # label(axiom_G7E) # label(axiom).  [assumption].
% 3.09/3.41  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,D) | -on(B,D) | -on(C,D) | -plane(D) | -on(A,E) | -on(B,E) | -on(C,E) | -plane(E) | D = E | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | line(line_through_3_points(A,B,C)).  [resolve(11,d,1,h)].
% 3.09/3.41  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,D) | -on(B,D) | -on(C,D) | -plane(D) | -on(A,E) | -on(B,E) | -on(C,E) | -plane(E) | D = E | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)).  [resolve(11,d,6,h)].
% 3.09/3.41  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,D) | -on(B,D) | -on(C,D) | -plane(D) | -on(A,E) | -on(B,E) | -on(C,E) | -plane(E) | D = E | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)).  [resolve(11,d,7,h)].
% 3.09/3.41  Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,D) | -on(B,D) | -on(C,D) | -plane(D) | -on(A,E) | -on(B,E) | -on(C,E) | -plane(E) | D = E | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)).  [resolve(11,d,8,h)].
% 3.09/3.41  
% 3.09/3.41  ============================== end predicate elimination =============
% 3.09/3.41  
% 3.09/3.41  Auto_denials:  (non-Horn, no changes).
% 3.09/3.41  
% 3.09/3.41  Term ordering decisions:
% 3.09/3.41  Function symbol KB weights:  a_plane=1. at_least_one_line=1. line_from_to=1. point_1_on_line=1. point_2_on_line=1. point_on_plane=1. point_not_on_line=1. point_not_on_plane=1. line_through_3_points=1. plane_for_points=1. common_point_on_planes=1.
% 3.09/3.41  
% 3.09/3.41  ============================== end of process initial clauses ========
% 3.09/3.41  
% 3.09/3.41  ============================== CLAUSES FOR SEARCH ====================
% 3.09/3.41  
% 3.09/3.41  ============================== end of clauses for search =============
% 3.09/3.41  
% 3.09/3.41  ============================== SEARCH ================================
% 3.09/3.41  
% 3.09/3.41  % Starting search at 0.15 seconds.
% 3.09/3.41  
% 3.09/3.41  Low Water (keep): wt=62.000, iters=3393
% 3.09/3.41  
% 3.09/3.41  Low Water (keep): wt=59.000, iters=3339
% 3.09/3.41  
% 3.09/3.41  Low Water (keep): wt=58.000, iters=3335
% 3.09/3.41  
% 3.09/3.41  Low Water (keep): wt=57.000, iters=3434
% 3.09/3.41  
% 3.09/3.41  Low Water (keep): wt=56.000, iters=3370
% 3.09/3.41  
% 3.09/3.41  Low Water (keep): wt=55.000, iters=3335
% 3.09/3.41  
% 3.09/3.41  Low Water (keep): wt=54.000, iters=3353
% 3.09/3.41  
% 3.09/3.41  Low Water (keep): wt=53.000, iters=3378
% 3.09/3.41  
% 3.09/3.41  Low Water (keep): wt=52.000, iters=3348
% 3.09/3.41  
% 3.09/3.41  Low Water (keep): wt=51.000, iters=3338
% 3.09/3.41  
% 3.09/3.41  Low Water (keep): wt=49.000, iters=3343
% 3.09/3.41  
% 3.09/3.41  Low Water (displace): id=2184, wt=119.000
% 3.09/3.41  
% 3.09/3.41  Low Water (displace): id=2169, wt=118.000
% 3.09/3.41  
% 3.09/3.41  Low Water (displace): id=2181, wt=114.000
% 3.09/3.41  
% 3.09/3.41  Low Water (displace): id=2196, wt=113.000
% 3.09/3.41  
% 3.09/3.41  Low Water (displace): id=2180, wt=99.000
% 3.09/3.41  
% 3.09/3.41  Low Water (displace): id=2175, wt=98.000
% 3.09/3.41  
% 3.09/3.41  Low Water (displace): id=2187, wt=94.000
% 3.09/3.41  
% 3.09/3.41  Low Water (displace): iCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------