TSTP Solution File: GEO063-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO063-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:40 EDT 2022
% Result : Unsatisfiable 0.79s 1.13s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : GEO063-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.14/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 12:16:10 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.79/1.13 ============================== Prover9 ===============================
% 0.79/1.13 Prover9 (32) version 2009-11A, November 2009.
% 0.79/1.13 Process 25046 was started by sandbox2 on n006.cluster.edu,
% 0.79/1.13 Sat Jun 18 12:16:11 2022
% 0.79/1.13 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24893_n006.cluster.edu".
% 0.79/1.13 ============================== end of head ===========================
% 0.79/1.13
% 0.79/1.13 ============================== INPUT =================================
% 0.79/1.13
% 0.79/1.13 % Reading from file /tmp/Prover9_24893_n006.cluster.edu
% 0.79/1.13
% 0.79/1.13 set(prolog_style_variables).
% 0.79/1.13 set(auto2).
% 0.79/1.13 % set(auto2) -> set(auto).
% 0.79/1.13 % set(auto) -> set(auto_inference).
% 0.79/1.13 % set(auto) -> set(auto_setup).
% 0.79/1.13 % set(auto_setup) -> set(predicate_elim).
% 0.79/1.13 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.79/1.13 % set(auto) -> set(auto_limits).
% 0.79/1.13 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.79/1.13 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.79/1.13 % set(auto) -> set(auto_denials).
% 0.79/1.13 % set(auto) -> set(auto_process).
% 0.79/1.13 % set(auto2) -> assign(new_constants, 1).
% 0.79/1.13 % set(auto2) -> assign(fold_denial_max, 3).
% 0.79/1.13 % set(auto2) -> assign(max_weight, "200.000").
% 0.79/1.13 % set(auto2) -> assign(max_hours, 1).
% 0.79/1.13 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.79/1.13 % set(auto2) -> assign(max_seconds, 0).
% 0.79/1.13 % set(auto2) -> assign(max_minutes, 5).
% 0.79/1.13 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.79/1.13 % set(auto2) -> set(sort_initial_sos).
% 0.79/1.13 % set(auto2) -> assign(sos_limit, -1).
% 0.79/1.13 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.79/1.13 % set(auto2) -> assign(max_megs, 400).
% 0.79/1.13 % set(auto2) -> assign(stats, some).
% 0.79/1.13 % set(auto2) -> clear(echo_input).
% 0.79/1.13 % set(auto2) -> set(quiet).
% 0.79/1.13 % set(auto2) -> clear(print_initial_clauses).
% 0.79/1.13 % set(auto2) -> clear(print_given).
% 0.79/1.13 assign(lrs_ticks,-1).
% 0.79/1.13 assign(sos_limit,10000).
% 0.79/1.13 assign(order,kbo).
% 0.79/1.13 set(lex_order_vars).
% 0.79/1.13 clear(print_given).
% 0.79/1.13
% 0.79/1.13 % formulas(sos). % not echoed (76 formulas)
% 0.79/1.13
% 0.79/1.13 ============================== end of input ==========================
% 0.79/1.13
% 0.79/1.13 % From the command line: assign(max_seconds, 300).
% 0.79/1.13
% 0.79/1.13 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.79/1.13
% 0.79/1.13 % Formulas that are not ordinary clauses:
% 0.79/1.13
% 0.79/1.13 ============================== end of process non-clausal formulas ===
% 0.79/1.13
% 0.79/1.13 ============================== PROCESS INITIAL CLAUSES ===============
% 0.79/1.13
% 0.79/1.13 ============================== PREDICATE ELIMINATION =================
% 0.79/1.13
% 0.79/1.13 ============================== end predicate elimination =============
% 0.79/1.13
% 0.79/1.13 Auto_denials: (non-Horn, no changes).
% 0.79/1.13
% 0.79/1.13 Term ordering decisions:
% 0.79/1.13 Function symbol KB weights: lower_dimension_point_1=1. lower_dimension_point_2=1. w=1. x=1. y=1. z=1. lower_dimension_point_3=1. u=1. v=1. reflection=1. extension=1. insertion=1. inner_pasch=1. euclid1=1. euclid2=1. continuous=1.
% 0.79/1.13
% 0.79/1.13 ============================== end of process initial clauses ========
% 0.79/1.13
% 0.79/1.13 ============================== CLAUSES FOR SEARCH ====================
% 0.79/1.13
% 0.79/1.13 ============================== end of clauses for search =============
% 0.79/1.13
% 0.79/1.13 ============================== SEARCH ================================
% 0.79/1.13
% 0.79/1.13 % Starting search at 0.02 seconds.
% 0.79/1.13
% 0.79/1.13 ============================== PROOF =================================
% 0.79/1.13 % SZS status Unsatisfiable
% 0.79/1.13 % SZS output start Refutation
% 0.79/1.13
% 0.79/1.13 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.79/1.13 % Length of proof is 10.
% 0.79/1.13 % Level of proof is 2.
% 0.79/1.13 % Maximum clause weight is 19.000.
% 0.79/1.13 % Given clauses 53.
% 0.79/1.13
% 0.79/1.13 8 equidistant(w,x,y,z) # label(w_to_x_equals_y_to_z) # label(hypothesis). [assumption].
% 0.79/1.13 24 insertion(A,B,C,D) = extension(extension(B,A,lower_dimension_point_1,lower_dimension_point_2),A,C,D) # label(insertion) # label(axiom). [assumption].
% 0.79/1.13 34 A != extension(B,A,lower_dimension_point_1,lower_dimension_point_2) # label(e3_1) # label(axiom). [assumption].
% 0.79/1.13 35 extension(A,B,lower_dimension_point_1,lower_dimension_point_2) != B. [copy(34),flip(a)].
% 0.79/1.13 36 insertion(u,v,w,x) != insertion(u,v,y,z) # label(prove_equality_of_insertions) # label(negated_conjecture). [assumption].
% 0.79/1.13 37 extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,y,z) != extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,w,x). [copy(36),rewrite([24(5),24(14)]),flip(a)].
% 0.79/1.13 45 -equidistant(A,B,C,D) | equidistant(C,D,A,B) # label(d2) # label(axiom). [assumption].
% 0.79/1.13 76 -equidistant(A,B,C,D) | extension(E,F,A,B) = extension(E,F,C,D) | E = F # label(d10_2) # label(axiom). [assumption].
% 0.79/1.13 161 equidistant(y,z,w,x). [resolve(45,a,8,a)].
% 0.79/1.13 278 $F. [ur(76,b,37,a,c,35,a),unit_del(a,161)].
% 0.79/1.13
% 0.79/1.13 % SZS output end Refutation
% 0.79/1.13 ============================== end of proof ==========================
% 0.79/1.13
% 0.79/1.13 ============================== STATISTICS ============================
% 0.79/1.13
% 0.79/1.13 Given=53. Generated=546. Kept=260. proofs=1.
% 0.79/1.13 Usable=53. Sos=194. Demods=9. Limbo=4, Disabled=85. Hints=0.
% 0.79/1.13 Megabytes=0.32.
% 0.79/1.13 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.79/1.13
% 0.79/1.13 ============================== end of statistics =====================
% 0.79/1.13
% 0.79/1.13 ============================== end of search =========================
% 0.79/1.13
% 0.79/1.13 THEOREM PROVED
% 0.79/1.13 % SZS status Unsatisfiable
% 0.79/1.13
% 0.79/1.13 Exiting with 1 proof.
% 0.79/1.13
% 0.79/1.13 Process 25046 exit (max_proofs) Sat Jun 18 12:16:11 2022
% 0.79/1.13 Prover9 interrupted
%------------------------------------------------------------------------------