TSTP Solution File: GEO100-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GEO100-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n008.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:59 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO100-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n008.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 05:46:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.72/1.02  ============================== Prover9 ===============================
% 0.72/1.02  Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.02  Process 32287 was started by sandbox2 on n008.cluster.edu,
% 0.72/1.02  Sat Jun 18 05:46:38 2022
% 0.72/1.02  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32133_n008.cluster.edu".
% 0.72/1.02  ============================== end of head ===========================
% 0.72/1.02  
% 0.72/1.02  ============================== INPUT =================================
% 0.72/1.02  
% 0.72/1.02  % Reading from file /tmp/Prover9_32133_n008.cluster.edu
% 0.72/1.02  
% 0.72/1.02  set(prolog_style_variables).
% 0.72/1.02  set(auto2).
% 0.72/1.02      % set(auto2) -> set(auto).
% 0.72/1.02      % set(auto) -> set(auto_inference).
% 0.72/1.02      % set(auto) -> set(auto_setup).
% 0.72/1.02      % set(auto_setup) -> set(predicate_elim).
% 0.72/1.02      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.02      % set(auto) -> set(auto_limits).
% 0.72/1.02      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.02      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.02      % set(auto) -> set(auto_denials).
% 0.72/1.02      % set(auto) -> set(auto_process).
% 0.72/1.02      % set(auto2) -> assign(new_constants, 1).
% 0.72/1.02      % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.02      % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.02      % set(auto2) -> assign(max_hours, 1).
% 0.72/1.02      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.02      % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.02      % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.02      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.02      % set(auto2) -> set(sort_initial_sos).
% 0.72/1.02      % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.02      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.02      % set(auto2) -> assign(max_megs, 400).
% 0.72/1.02      % set(auto2) -> assign(stats, some).
% 0.72/1.02      % set(auto2) -> clear(echo_input).
% 0.72/1.02      % set(auto2) -> set(quiet).
% 0.72/1.02      % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.02      % set(auto2) -> clear(print_given).
% 0.72/1.02  assign(lrs_ticks,-1).
% 0.72/1.02  assign(sos_limit,10000).
% 0.72/1.02  assign(order,kbo).
% 0.72/1.02  set(lex_order_vars).
% 0.72/1.02  clear(print_given).
% 0.72/1.02  
% 0.72/1.02  % formulas(sos).  % not echoed (54 formulas)
% 0.72/1.02  
% 0.72/1.02  ============================== end of input ==========================
% 0.72/1.02  
% 0.72/1.02  % From the command line: assign(max_seconds, 300).
% 0.72/1.02  
% 0.72/1.02  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.02  
% 0.72/1.02  % Formulas that are not ordinary clauses:
% 0.72/1.02  
% 0.72/1.02  ============================== end of process non-clausal formulas ===
% 0.72/1.02  
% 0.72/1.02  ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.02  
% 0.72/1.02  ============================== PREDICATE ELIMINATION =================
% 0.72/1.02  1 -open(A) | end_point(ax0_sk7(A),A) # label(open_defn_33) # label(axiom).  [assumption].
% 0.72/1.02  2 open(sk14) # label(theorem_2_18_67) # label(negated_conjecture).  [assumption].
% 0.72/1.02  3 -end_point(A,B) | open(B) # label(open_defn_34) # label(axiom).  [assumption].
% 0.72/1.02  Derived: end_point(ax0_sk7(sk14),sk14).  [resolve(1,a,2,a)].
% 0.72/1.02  Derived: end_point(ax0_sk7(A),A) | -end_point(B,A).  [resolve(1,a,3,b)].
% 0.72/1.02  4 -part_of(A,B) | A = B | open(A) # label(c1_35) # label(axiom).  [assumption].
% 0.72/1.02  Derived: -part_of(A,B) | A = B | end_point(ax0_sk7(A),A).  [resolve(4,c,1,a)].
% 0.72/1.02  5 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn_22) # label(axiom).  [assumption].
% 0.72/1.02  6 inner_point(ax0_sk8(A),A) # label(c3_37) # label(axiom).  [assumption].
% 0.72/1.02  Derived: -end_point(ax0_sk8(A),A).  [resolve(5,a,6,a)].
% 0.72/1.02  7 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn_21) # label(axiom).  [assumption].
% 0.72/1.02  Derived: incident_c(ax0_sk8(A),A).  [resolve(7,a,6,a)].
% 0.72/1.02  8 -incident_c(A,B) | end_point(A,B) | inner_point(A,B) # label(inner_point_defn_23) # label(axiom).  [assumption].
% 0.72/1.02  9 -inner_point(A,B) | meet(A,ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_38) # label(axiom).  [assumption].
% 0.72/1.02  Derived: meet(ax0_sk8(A),ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)).  [resolve(9,a,6,a)].
% 0.72/1.02  Derived: meet(A,ax0_sk9(A,B),ax0_sk10(A,B)) | -incident_c(A,B) | end_point(A,B).  [resolve(9,a,8,c)].
% 0.72/1.02  10 -inner_point(A,B) | B = sum(ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_39) # label(axiom).  [assumption].
% 0.72/1.02  Derived: A = sum(ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)).  [resolve(10,a,6,a)].
% 0.72/1.02  Derived: A = sum(ax0_sk9(B,A),ax0_sk10(B,A)) | -incident_c(B,A) | end_point(B,A).  [resolve(10,a,8,c)].
% 0.72/1.02  11 -closed(A) | -end_point(B,A) # label(closed_defn_31) # label(axiom).  [assumption].
% 0.72/1.02  12 end_point(ax0_sk6(Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------