TSTP Solution File: GEO087-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO087-1 : TPTP v8.1.0. Released v2.4.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:52 EDT 2022
% Result : Unsatisfiable 0.86s 1.12s
% Output : Refutation 0.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO087-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.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 07:38:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.08 ============================== Prover9 ===============================
% 0.45/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.08 Process 23332 was started by sandbox on n026.cluster.edu,
% 0.45/1.08 Sat Jun 18 07:38:25 2022
% 0.45/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23027_n026.cluster.edu".
% 0.45/1.08 ============================== end of head ===========================
% 0.45/1.08
% 0.45/1.08 ============================== INPUT =================================
% 0.45/1.08
% 0.45/1.08 % Reading from file /tmp/Prover9_23027_n026.cluster.edu
% 0.45/1.08
% 0.45/1.08 set(prolog_style_variables).
% 0.45/1.08 set(auto2).
% 0.45/1.08 % set(auto2) -> set(auto).
% 0.45/1.08 % set(auto) -> set(auto_inference).
% 0.45/1.08 % set(auto) -> set(auto_setup).
% 0.45/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.08 % set(auto) -> set(auto_limits).
% 0.45/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.08 % set(auto) -> set(auto_denials).
% 0.45/1.08 % set(auto) -> set(auto_process).
% 0.45/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.08 % set(auto2) -> assign(stats, some).
% 0.45/1.08 % set(auto2) -> clear(echo_input).
% 0.45/1.08 % set(auto2) -> set(quiet).
% 0.45/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.08 % set(auto2) -> clear(print_given).
% 0.45/1.08 assign(lrs_ticks,-1).
% 0.45/1.08 assign(sos_limit,10000).
% 0.45/1.08 assign(order,kbo).
% 0.45/1.08 set(lex_order_vars).
% 0.45/1.08 clear(print_given).
% 0.45/1.08
% 0.45/1.08 % formulas(sos). % not echoed (50 formulas)
% 0.45/1.08
% 0.45/1.08 ============================== end of input ==========================
% 0.45/1.08
% 0.45/1.08 % From the command line: assign(max_seconds, 300).
% 0.45/1.08
% 0.45/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.08
% 0.45/1.08 % Formulas that are not ordinary clauses:
% 0.45/1.08
% 0.45/1.08 ============================== end of process non-clausal formulas ===
% 0.45/1.08
% 0.45/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.08
% 0.45/1.08 ============================== PREDICATE ELIMINATION =================
% 0.45/1.08 1 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn_22) # label(axiom). [assumption].
% 0.45/1.08 2 inner_point(ax0_sk8(A),A) # label(c3_37) # label(axiom). [assumption].
% 0.45/1.08 Derived: -end_point(ax0_sk8(A),A). [resolve(1,a,2,a)].
% 0.45/1.08 3 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn_21) # label(axiom). [assumption].
% 0.45/1.08 Derived: incident_c(ax0_sk8(A),A). [resolve(3,a,2,a)].
% 0.45/1.08 4 -incident_c(A,B) | end_point(A,B) | inner_point(A,B) # label(inner_point_defn_23) # label(axiom). [assumption].
% 0.45/1.08 5 -inner_point(A,B) | meet(A,ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_38) # label(axiom). [assumption].
% 0.45/1.08 Derived: meet(ax0_sk8(A),ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)). [resolve(5,a,2,a)].
% 0.45/1.08 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.86/1.08 6 -inner_point(A,B) | B = sum(ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_39) # label(axiom). [assumption].
% 0.86/1.08 Derived: A = sum(ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)). [resolve(6,a,2,a)].
% 0.86/1.08 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.86/1.08 7 -closed(A) | -end_point(B,A) # label(closed_defn_31) # label(axiom). [assumption].
% 0.86/1.08 8 end_point(ax0_sk6(A),A) | closed(A) # label(closed_defn_32) # label(axiom). [assumption].
% 0.86/1.08 Derived: -end_point(A,B) | end_point(ax0_sk6(B),B). [resolve(7,a,8,b)].
% 0.86/1.08 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.86/1.08 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.86/1.08 10 -open(A) | end_point(ax0_sk7(A),A) # label(open_defn_33) # label(axiom). [assumption].
% 0.86/1.08 11 -end_point(A,B) | open(B) # label(open_defn_34) # label(axiom). [assumption].
% 0.86/1.12 Derived: end_point(ax0_sk7(A),A) | -end_point(B,A). [resolve(10,a,11,b)].
% 0.86/1.12 12 -part_of(A,B) | A = B | open(A) # label(c1_35) # label(axiom). [assumption].
% 0.86/1.12 Derived: -part_of(A,B) | A = B | end_point(ax0_sk7(A),A). [resolve(12,c,10,a)].
% 0.86/1.12
% 0.86/1.12 ============================== end predicate elimination =============
% 0.86/1.12
% 0.86/1.12 Auto_denials: (non-Horn, no changes).
% 0.86/1.12
% 0.86/1.12 Term ordering decisions:
% 0.86/1.12 Function symbol KB weights: sk14=1. sk15=1. sk16=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.
% 0.86/1.12
% 0.86/1.12 ============================== end of process initial clauses ========
% 0.86/1.12
% 0.86/1.12 ============================== CLAUSES FOR SEARCH ====================
% 0.86/1.12
% 0.86/1.12 ============================== end of clauses for search =============
% 0.86/1.12
% 0.86/1.12 ============================== SEARCH ================================
% 0.86/1.12
% 0.86/1.12 % Starting search at 0.02 seconds.
% 0.86/1.12
% 0.86/1.12 ============================== PROOF =================================
% 0.86/1.12 % SZS status Unsatisfiable
% 0.86/1.12 % SZS output start Refutation
% 0.86/1.12
% 0.86/1.12 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.86/1.12 % Length of proof is 11.
% 0.86/1.12 % Level of proof is 3.
% 0.86/1.12 % Maximum clause weight is 13.000.
% 0.86/1.12 % Given clauses 56.
% 0.86/1.12
% 0.86/1.12 1 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn_22) # label(axiom). [assumption].
% 0.86/1.12 2 inner_point(ax0_sk8(A),A) # label(c3_37) # label(axiom). [assumption].
% 0.86/1.12 3 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn_21) # label(axiom). [assumption].
% 0.86/1.12 13 part_of(sk14,sk15) # label(corollary_2_9_67) # label(negated_conjecture). [assumption].
% 0.86/1.12 14 meet(sk16,sk14,sk15) # label(corollary_2_9_68) # label(negated_conjecture). [assumption].
% 0.86/1.12 26 -part_of(A,B) | -incident_c(C,A) | incident_c(C,B) # label(part_of_defn_1) # label(axiom). [assumption].
% 0.86/1.12 38 -meet(A,B,C) | -incident_c(D,B) | -incident_c(D,C) | end_point(D,B) # label(meet_defn_26) # label(axiom). [assumption].
% 0.86/1.12 56 -end_point(ax0_sk8(A),A). [resolve(1,a,2,a)].
% 0.86/1.12 57 incident_c(ax0_sk8(A),A). [resolve(3,a,2,a)].
% 0.86/1.12 266 -incident_c(ax0_sk8(sk14),sk15). [ur(38,a,14,a,b,57,a,d,56,a)].
% 0.86/1.12 391 $F. [ur(26,b,57,a,c,266,a),unit_del(a,13)].
% 0.86/1.12
% 0.86/1.12 % SZS output end Refutation
% 0.86/1.12 ============================== end of proof ==========================
% 0.86/1.12
% 0.86/1.12 ============================== STATISTICS ============================
% 0.86/1.12
% 0.86/1.12 Given=56. Generated=663. Kept=365. proofs=1.
% 0.86/1.12 Usable=54. Sos=260. Demods=3. Limbo=5, Disabled=106. Hints=0.
% 0.86/1.12 Megabytes=0.39.
% 0.86/1.12 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.86/1.12
% 0.86/1.12 ============================== end of statistics =====================
% 0.86/1.12
% 0.86/1.12 ============================== end of search =========================
% 0.86/1.12
% 0.86/1.12 THEOREM PROVED
% 0.86/1.12 % SZS status Unsatisfiable
% 0.86/1.12
% 0.86/1.12 Exiting with 1 proof.
% 0.86/1.12
% 0.86/1.12 Process 23332 exit (max_proofs) Sat Jun 18 07:38:25 2022
% 0.86/1.12 Prover9 interrupted
%------------------------------------------------------------------------------