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

View Problem - Process Solution

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

% Computer : n021.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:50 EDT 2022

% Result   : Unsatisfiable 6.98s 7.26s
% Output   : Refutation 6.98s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GEO083-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n021.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 17:14:17 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.44/1.02  ============================== Prover9 ===============================
% 0.44/1.02  Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.02  Process 6212 was started by sandbox2 on n021.cluster.edu,
% 0.44/1.02  Sat Jun 18 17:14:17 2022
% 0.44/1.02  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_6059_n021.cluster.edu".
% 0.44/1.02  ============================== end of head ===========================
% 0.44/1.02  
% 0.44/1.02  ============================== INPUT =================================
% 0.44/1.02  
% 0.44/1.02  % Reading from file /tmp/Prover9_6059_n021.cluster.edu
% 0.44/1.02  
% 0.44/1.02  set(prolog_style_variables).
% 0.44/1.02  set(auto2).
% 0.44/1.02      % set(auto2) -> set(auto).
% 0.44/1.02      % set(auto) -> set(auto_inference).
% 0.44/1.02      % set(auto) -> set(auto_setup).
% 0.44/1.02      % set(auto_setup) -> set(predicate_elim).
% 0.44/1.02      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.02      % set(auto) -> set(auto_limits).
% 0.44/1.02      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.02      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.02      % set(auto) -> set(auto_denials).
% 0.44/1.02      % set(auto) -> set(auto_process).
% 0.44/1.02      % set(auto2) -> assign(new_constants, 1).
% 0.44/1.02      % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.02      % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.02      % set(auto2) -> assign(max_hours, 1).
% 0.44/1.02      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.02      % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.02      % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.02      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.02      % set(auto2) -> set(sort_initial_sos).
% 0.44/1.02      % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.02      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.02      % set(auto2) -> assign(max_megs, 400).
% 0.44/1.02      % set(auto2) -> assign(stats, some).
% 0.44/1.02      % set(auto2) -> clear(echo_input).
% 0.44/1.02      % set(auto2) -> set(quiet).
% 0.44/1.02      % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.02      % set(auto2) -> clear(print_given).
% 0.44/1.02  assign(lrs_ticks,-1).
% 0.44/1.02  assign(sos_limit,10000).
% 0.44/1.02  assign(order,kbo).
% 0.44/1.02  set(lex_order_vars).
% 0.44/1.02  clear(print_given).
% 0.44/1.02  
% 0.44/1.02  % formulas(sos).  % not echoed (52 formulas)
% 0.44/1.02  
% 0.44/1.02  ============================== end of input ==========================
% 0.44/1.02  
% 0.44/1.02  % From the command line: assign(max_seconds, 300).
% 0.44/1.02  
% 0.44/1.02  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.02  
% 0.44/1.02  % Formulas that are not ordinary clauses:
% 0.44/1.02  
% 0.44/1.02  ============================== end of process non-clausal formulas ===
% 0.44/1.02  
% 0.44/1.02  ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.02  
% 0.44/1.02  ============================== PREDICATE ELIMINATION =================
% 0.44/1.02  1 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn_22) # label(axiom).  [assumption].
% 0.44/1.02  2 inner_point(ax0_sk8(A),A) # label(c3_37) # label(axiom).  [assumption].
% 0.44/1.02  Derived: -end_point(ax0_sk8(A),A).  [resolve(1,a,2,a)].
% 0.44/1.02  3 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn_21) # label(axiom).  [assumption].
% 0.44/1.02  Derived: incident_c(ax0_sk8(A),A).  [resolve(3,a,2,a)].
% 0.44/1.02  4 -incident_c(A,B) | end_point(A,B) | inner_point(A,B) # label(inner_point_defn_23) # label(axiom).  [assumption].
% 0.44/1.02  5 -inner_point(A,B) | meet(A,ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_38) # label(axiom).  [assumption].
% 0.44/1.02  Derived: meet(ax0_sk8(A),ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)).  [resolve(5,a,2,a)].
% 0.44/1.02  Derived: meet(A,ax0_sk9(A,B),ax0_sk10(A,B)) | -incident_c(A,B) | end_point(A,B).  [resolve(5,a,4,c)].
% 0.44/1.02  6 -inner_point(A,B) | B = sum(ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_39) # label(axiom).  [assumption].
% 0.44/1.02  Derived: A = sum(ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)).  [resolve(6,a,2,a)].
% 0.44/1.02  Derived: A = sum(ax0_sk9(B,A),ax0_sk10(B,A)) | -incident_c(B,A) | end_point(B,A).  [resolve(6,a,4,c)].
% 0.44/1.02  7 -closed(A) | -end_point(B,A) # label(closed_defn_31) # label(axiom).  [assumption].
% 0.44/1.02  8 end_point(ax0_sk6(A),A) | closed(A) # label(closed_defn_32) # label(axiom).  [assumption].
% 0.44/1.02  Derived: -end_point(A,B) | end_point(ax0_sk6(B),B).  [resolve(7,a,8,b)].
% 0.44/1.02  9 -closed(A) | -meet(B,C,D) | A != sum(C,D) | -end_point(E,C) | meet(E,C,D) # label(c7_43) # label(axiom).  [assumption].
% 0.44/1.02  Derived: -meet(A,B,C) | D != sum(B,C) | -end_point(E,B) | meet(E,B,C) | end_point(ax0_sk6(D),D).  [resolve(9,a,8,b)].
% 0.44/1.02  10 -open(A) | end_point(ax0_sk7(A),A) # label(open_defn_33) # label(axiom).  [assumption].
% 0.44/1.02  11 -end_point(A,B) | open(B) # label(open_defn_34) # label(axiom).  [assumption].
% 6.98/7.26  Derived: end_point(ax0_sk7(A),A) | -end_point(B,A).  [resolve(10,a,11,b)].
% 6.98/7.26  12 -part_of(A,B) | A = B | open(A) # label(c1_35) # label(axiom).  [assumption].
% 6.98/7.26  Derived: -part_of(A,B) | A = B | end_point(ax0_sk7(A),A).  [resolve(12,c,10,a)].
% 6.98/7.26  
% 6.98/7.26  ============================== end predicate elimination =============
% 6.98/7.26  
% 6.98/7.26  Auto_denials:  (non-Horn, no changes).
% 6.98/7.26  
% 6.98/7.26  Term ordering decisions:
% 6.98/7.26  Function symbol KB weights:  sk14=1. sk15=1. sk16=1. sk17=1. sum=1. ax0_sk13=1. ax0_sk10=1. ax0_sk3=1. ax0_sk4=1. ax0_sk9=1. ax0_sk1=1. ax0_sk11=1. ax0_sk12=1. ax0_sk8=1. ax0_sk6=1. ax0_sk7=1. ax0_sk2=1. ax0_sk5=1.
% 6.98/7.26  
% 6.98/7.26  ============================== end of process initial clauses ========
% 6.98/7.26  
% 6.98/7.26  ============================== CLAUSES FOR SEARCH ====================
% 6.98/7.26  
% 6.98/7.26  ============================== end of clauses for search =============
% 6.98/7.26  
% 6.98/7.26  ============================== SEARCH ================================
% 6.98/7.26  
% 6.98/7.26  % Starting search at 0.02 seconds.
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=43.000, iters=3380
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=36.000, iters=3369
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=34.000, iters=3345
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=32.000, iters=3349
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=30.000, iters=3394
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=28.000, iters=3336
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=26.000, iters=3381
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=25.000, iters=3544
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=24.000, iters=3433
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=23.000, iters=3351
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=15.000, iters=3393
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=14.000, iters=3400
% 6.98/7.26  
% 6.98/7.26  Low Water (keep): wt=13.000, iters=3384
% 6.98/7.26  
% 6.98/7.26  ============================== PROOF =================================
% 6.98/7.26  % SZS status Unsatisfiable
% 6.98/7.26  % SZS output start Refutation
% 6.98/7.26  
% 6.98/7.26  % Proof 1 at 6.22 (+ 0.04) seconds.
% 6.98/7.26  % Length of proof is 19.
% 6.98/7.26  % Level of proof is 4.
% 6.98/7.26  % Maximum clause weight is 25.000.
% 6.98/7.26  % Given clauses 1851.
% 6.98/7.26  
% 6.98/7.26  13 part_of(sk15,sk16) # label(corollary_2_6_1_67) # label(negated_conjecture).  [assumption].
% 6.98/7.26  16 incident_c(ax0_sk1(A,B),A) | part_of(A,B) # label(part_of_defn_2) # label(axiom).  [assumption].
% 6.98/7.26  20 -part_of(sum(sk14,sk15),sum(sk14,sk16)) # label(corollary_2_6_1_70) # label(negated_conjecture).  [assumption].
% 6.98/7.26  26 -incident_c(ax0_sk1(A,B),B) | part_of(A,B) # label(part_of_defn_3) # label(axiom).  [assumption].
% 6.98/7.26  28 -part_of(A,B) | -incident_c(C,A) | incident_c(C,B) # label(part_of_defn_1) # label(axiom).  [assumption].
% 6.98/7.26  29 A != sum(B,C) | -incident_c(D,B) | incident_c(D,A) # label(sum_defn_5) # label(axiom).  [assumption].
% 6.98/7.26  30 sum(A,B) != C | -incident_c(D,A) | incident_c(D,C).  [copy(29),flip(a)].
% 6.98/7.26  31 A != sum(B,C) | -incident_c(D,C) | incident_c(D,A) # label(sum_defn_6) # label(axiom).  [assumption].
% 6.98/7.26  32 sum(A,B) != C | -incident_c(D,B) | incident_c(D,C).  [copy(31),flip(a)].
% 6.98/7.26  43 A != sum(B,C) | -incident_c(D,A) | incident_c(D,B) | incident_c(D,C) # label(sum_defn_4) # label(axiom).  [assumption].
% 6.98/7.26  44 sum(A,B) != C | -incident_c(D,C) | incident_c(D,A) | incident_c(D,B).  [copy(43),flip(a)].
% 6.98/7.26  84 incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sum(sk14,sk15)).  [resolve(20,a,16,b)].
% 6.98/7.26  88 -incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sum(sk14,sk16)).  [ur(26,b,20,a)].
% 6.98/7.26  90 -incident_c(A,sk15) | incident_c(A,sk16).  [resolve(28,a,13,a)].
% 6.98/7.26  378 sum(sk14,sk15) != sum(A,B) | incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),A) | incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),B).  [resolve(84,a,44,b),flip(a)].
% 6.98/7.26  467 -incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sk16).  [ur(32,a,xx,c,88,a)].
% 6.98/7.26  470 -incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sk14).  [ur(30,a,xx,c,88,a)].
% 6.98/7.26  14243 incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sk15).  [xx_res(378,a),unit_del(a,470)].
% 6.98/7.26  14270 $F.  [resolve(14243,a,90,a),unit_del(a,467)].
% 6.98/7.26  
% 6.98/7.26  % SZS output end Refutation
% 6.98/7.26  ============================== end of proof ==========================
% 6.98/7.26  
% 6.98/7.26  ============================== STATISTICS ============================
% 6.98/7.26  
% 6.98/7.26  Given=1851. Generated=52334. Kept=14244. proofs=1.
% 6.98/7.26  Usable=1627. Sos=8679. Demods=18. Limbo=6, Disabled=3994. Hints=0.
% 6.98/7.26  Megabytes=11.21.
% 6.98/7.26  User_CPU=6.22, System_CPU=0.04, Wall_clock=7.
% 6.98/7.26  
% 6.98/7.26  ============================== end of statistics =====================
% 6.98/7.26  
% 6.98/7.26  ============================== end of search =========================
% 6.98/7.26  
% 6.98/7.26  THEOREM PROVED
% 6.98/7.26  % SZS status Unsatisfiable
% 6.98/7.26  
% 6.98/7.26  Exiting with 1 proof.
% 6.98/7.26  
% 6.98/7.26  Process 6212 exit (max_proofs) Sat Jun 18 17:14:24 2022
% 6.98/7.26  Prover9 interrupted
%------------------------------------------------------------------------------