TSTP Solution File: GEO029-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO029-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:22 EDT 2022
% Result : Unsatisfiable 7.36s 7.65s
% Output : Refutation 7.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GEO029-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 11:21:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 7.36/7.65 ============================== Prover9 ===============================
% 7.36/7.65 Prover9 (32) version 2009-11A, November 2009.
% 7.36/7.65 Process 27467 was started by sandbox2 on n027.cluster.edu,
% 7.36/7.65 Sat Jun 18 11:21:23 2022
% 7.36/7.65 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27314_n027.cluster.edu".
% 7.36/7.65 ============================== end of head ===========================
% 7.36/7.65
% 7.36/7.65 ============================== INPUT =================================
% 7.36/7.65
% 7.36/7.65 % Reading from file /tmp/Prover9_27314_n027.cluster.edu
% 7.36/7.65
% 7.36/7.65 set(prolog_style_variables).
% 7.36/7.65 set(auto2).
% 7.36/7.65 % set(auto2) -> set(auto).
% 7.36/7.65 % set(auto) -> set(auto_inference).
% 7.36/7.65 % set(auto) -> set(auto_setup).
% 7.36/7.65 % set(auto_setup) -> set(predicate_elim).
% 7.36/7.65 % set(auto_setup) -> assign(eq_defs, unfold).
% 7.36/7.65 % set(auto) -> set(auto_limits).
% 7.36/7.65 % set(auto_limits) -> assign(max_weight, "100.000").
% 7.36/7.65 % set(auto_limits) -> assign(sos_limit, 20000).
% 7.36/7.65 % set(auto) -> set(auto_denials).
% 7.36/7.65 % set(auto) -> set(auto_process).
% 7.36/7.65 % set(auto2) -> assign(new_constants, 1).
% 7.36/7.65 % set(auto2) -> assign(fold_denial_max, 3).
% 7.36/7.65 % set(auto2) -> assign(max_weight, "200.000").
% 7.36/7.65 % set(auto2) -> assign(max_hours, 1).
% 7.36/7.65 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 7.36/7.65 % set(auto2) -> assign(max_seconds, 0).
% 7.36/7.65 % set(auto2) -> assign(max_minutes, 5).
% 7.36/7.65 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 7.36/7.65 % set(auto2) -> set(sort_initial_sos).
% 7.36/7.65 % set(auto2) -> assign(sos_limit, -1).
% 7.36/7.65 % set(auto2) -> assign(lrs_ticks, 3000).
% 7.36/7.65 % set(auto2) -> assign(max_megs, 400).
% 7.36/7.65 % set(auto2) -> assign(stats, some).
% 7.36/7.65 % set(auto2) -> clear(echo_input).
% 7.36/7.65 % set(auto2) -> set(quiet).
% 7.36/7.65 % set(auto2) -> clear(print_initial_clauses).
% 7.36/7.65 % set(auto2) -> clear(print_given).
% 7.36/7.65 assign(lrs_ticks,-1).
% 7.36/7.65 assign(sos_limit,10000).
% 7.36/7.65 assign(order,kbo).
% 7.36/7.65 set(lex_order_vars).
% 7.36/7.65 clear(print_given).
% 7.36/7.65
% 7.36/7.65 % formulas(sos). % not echoed (40 formulas)
% 7.36/7.65
% 7.36/7.65 ============================== end of input ==========================
% 7.36/7.65
% 7.36/7.65 % From the command line: assign(max_seconds, 300).
% 7.36/7.65
% 7.36/7.65 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 7.36/7.65
% 7.36/7.65 % Formulas that are not ordinary clauses:
% 7.36/7.65
% 7.36/7.65 ============================== end of process non-clausal formulas ===
% 7.36/7.65
% 7.36/7.65 ============================== PROCESS INITIAL CLAUSES ===============
% 7.36/7.65
% 7.36/7.65 ============================== PREDICATE ELIMINATION =================
% 7.36/7.65
% 7.36/7.65 ============================== end predicate elimination =============
% 7.36/7.65
% 7.36/7.65 Auto_denials: (non-Horn, no changes).
% 7.36/7.65
% 7.36/7.65 Term ordering decisions:
% 7.36/7.65 Function symbol KB weights: lower_dimension_point_1=1. lower_dimension_point_2=1. lower_dimension_point_3=1. u=1. v=1. reflection=1. extension=1. euclid1=1. euclid2=1. inner_pasch=1. continuous=1.
% 7.36/7.65
% 7.36/7.65 ============================== end of process initial clauses ========
% 7.36/7.65
% 7.36/7.65 ============================== CLAUSES FOR SEARCH ====================
% 7.36/7.65
% 7.36/7.65 ============================== end of clauses for search =============
% 7.36/7.65
% 7.36/7.65 ============================== SEARCH ================================
% 7.36/7.65
% 7.36/7.65 % Starting search at 0.02 seconds.
% 7.36/7.65
% 7.36/7.65 ============================== PROOF =================================
% 7.36/7.65 % SZS status Unsatisfiable
% 7.36/7.65 % SZS output start Refutation
% 7.36/7.65
% 7.36/7.65 % Proof 1 at 6.67 (+ 0.00) seconds.
% 7.36/7.65 % Length of proof is 14.
% 7.36/7.65 % Level of proof is 3.
% 7.36/7.65 % Maximum clause weight is 19.000.
% 7.36/7.65 % Given clauses 162.
% 7.36/7.65
% 7.36/7.65 10 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom). [assumption].
% 7.36/7.65 11 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom). [assumption].
% 7.36/7.65 13 u != v # label(u_not_v) # label(hypothesis). [assumption].
% 7.36/7.65 14 v != u. [copy(13),flip(a)].
% 7.36/7.65 18 extension(u,v,u,v) != extension(u,v,v,u) # label(prove_equal_extensions) # label(negated_conjecture). [assumption].
% 7.36/7.65 19 extension(u,v,v,u) != extension(u,v,u,v). [copy(18),flip(a)].
% 7.36/7.65 31 -equidistant(A,B,C,D) | equidistant(D,C,A,B) # label(d4_4) # label(axiom). [assumption].
% 7.36/7.65 36 -equidistant(A,B,C,D) | -equidistant(C,D,E,F) | equidistant(A,B,E,F) # label(d5) # label(axiom). [assumption].
% 7.36/7.65 39 -between(A,B,C) | -between(A,B,D) | -equidistant(B,C,B,D) | A = B | C = D # label(d9) # label(axiom). [assumption].
% 7.36/7.65 83 equidistant(A,B,C,extension(D,C,B,A)). [resolve(31,a,11,a)].
% 7.36/7.65 93 -equidistant(A,B,C,D) | equidistant(E,extension(F,E,A,B),C,D). [resolve(36,a,11,a)].
% 7.36/7.65 102 -equidistant(v,extension(u,v,u,v),v,extension(u,v,v,u)). [ur(39,a,10,a,b,10,a,d,14,a(flip),e,19,a(flip))].
% 7.36/7.65 947 equidistant(A,extension(B,A,C,D),E,extension(F,E,D,C)). [resolve(93,a,83,a)].
% 7.36/7.65 948 $F. [resolve(947,a,102,a)].
% 7.36/7.65
% 7.36/7.65 % SZS output end Refutation
% 7.36/7.65 ============================== end of proof ==========================
% 7.36/7.65
% 7.36/7.65 ============================== STATISTICS ============================
% 7.36/7.65
% 7.36/7.65 Given=162. Generated=2910. Kept=940. proofs=1.
% 7.36/7.65 Usable=153. Sos=683. Demods=12. Limbo=3, Disabled=140. Hints=0.
% 7.36/7.65 Megabytes=0.83.
% 7.36/7.65 User_CPU=6.67, System_CPU=0.00, Wall_clock=7.
% 7.36/7.65
% 7.36/7.65 ============================== end of statistics =====================
% 7.36/7.65
% 7.36/7.65 ============================== end of search =========================
% 7.36/7.65
% 7.36/7.65 THEOREM PROVED
% 7.36/7.65 % SZS status Unsatisfiable
% 7.36/7.65
% 7.36/7.65 Exiting with 1 proof.
% 7.36/7.65
% 7.36/7.65 Process 27467 exit (max_proofs) Sat Jun 18 11:21:30 2022
% 7.36/7.65 Prover9 interrupted
%------------------------------------------------------------------------------