TSTP Solution File: GEO030-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO030-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:23 EDT 2022
% Result : Unsatisfiable 1.42s 1.71s
% Output : Refutation 1.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO030-3 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n007.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 08:58:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.42/1.71 ============================== Prover9 ===============================
% 1.42/1.71 Prover9 (32) version 2009-11A, November 2009.
% 1.42/1.71 Process 14502 was started by sandbox on n007.cluster.edu,
% 1.42/1.71 Sat Jun 18 08:58:58 2022
% 1.42/1.71 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14349_n007.cluster.edu".
% 1.42/1.71 ============================== end of head ===========================
% 1.42/1.71
% 1.42/1.71 ============================== INPUT =================================
% 1.42/1.71
% 1.42/1.71 % Reading from file /tmp/Prover9_14349_n007.cluster.edu
% 1.42/1.71
% 1.42/1.71 set(prolog_style_variables).
% 1.42/1.71 set(auto2).
% 1.42/1.71 % set(auto2) -> set(auto).
% 1.42/1.71 % set(auto) -> set(auto_inference).
% 1.42/1.71 % set(auto) -> set(auto_setup).
% 1.42/1.71 % set(auto_setup) -> set(predicate_elim).
% 1.42/1.71 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.42/1.71 % set(auto) -> set(auto_limits).
% 1.42/1.71 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.42/1.71 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.42/1.71 % set(auto) -> set(auto_denials).
% 1.42/1.71 % set(auto) -> set(auto_process).
% 1.42/1.71 % set(auto2) -> assign(new_constants, 1).
% 1.42/1.71 % set(auto2) -> assign(fold_denial_max, 3).
% 1.42/1.71 % set(auto2) -> assign(max_weight, "200.000").
% 1.42/1.71 % set(auto2) -> assign(max_hours, 1).
% 1.42/1.71 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.42/1.71 % set(auto2) -> assign(max_seconds, 0).
% 1.42/1.71 % set(auto2) -> assign(max_minutes, 5).
% 1.42/1.71 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.42/1.71 % set(auto2) -> set(sort_initial_sos).
% 1.42/1.71 % set(auto2) -> assign(sos_limit, -1).
% 1.42/1.71 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.42/1.71 % set(auto2) -> assign(max_megs, 400).
% 1.42/1.71 % set(auto2) -> assign(stats, some).
% 1.42/1.71 % set(auto2) -> clear(echo_input).
% 1.42/1.71 % set(auto2) -> set(quiet).
% 1.42/1.71 % set(auto2) -> clear(print_initial_clauses).
% 1.42/1.71 % set(auto2) -> clear(print_given).
% 1.42/1.71 assign(lrs_ticks,-1).
% 1.42/1.71 assign(sos_limit,10000).
% 1.42/1.71 assign(order,kbo).
% 1.42/1.71 set(lex_order_vars).
% 1.42/1.71 clear(print_given).
% 1.42/1.71
% 1.42/1.71 % formulas(sos). % not echoed (69 formulas)
% 1.42/1.71
% 1.42/1.71 ============================== end of input ==========================
% 1.42/1.71
% 1.42/1.71 % From the command line: assign(max_seconds, 300).
% 1.42/1.71
% 1.42/1.71 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.42/1.71
% 1.42/1.71 % Formulas that are not ordinary clauses:
% 1.42/1.71
% 1.42/1.71 ============================== end of process non-clausal formulas ===
% 1.42/1.71
% 1.42/1.71 ============================== PROCESS INITIAL CLAUSES ===============
% 1.42/1.71
% 1.42/1.71 ============================== PREDICATE ELIMINATION =================
% 1.42/1.71
% 1.42/1.71 ============================== end predicate elimination =============
% 1.42/1.71
% 1.42/1.71 Auto_denials: (non-Horn, no changes).
% 1.42/1.71
% 1.42/1.71 Term ordering decisions:
% 1.42/1.71 Function symbol KB weights: lower_dimension_point_1=1. lower_dimension_point_2=1. u=1. v=1. w=1. w1=1. lower_dimension_point_3=1. reflection=1. extension=1. inner_pasch=1. euclid1=1. euclid2=1. continuous=1.
% 1.42/1.71
% 1.42/1.71 ============================== end of process initial clauses ========
% 1.42/1.71
% 1.42/1.71 ============================== CLAUSES FOR SEARCH ====================
% 1.42/1.71
% 1.42/1.71 ============================== end of clauses for search =============
% 1.42/1.71
% 1.42/1.71 ============================== SEARCH ================================
% 1.42/1.71
% 1.42/1.71 % Starting search at 0.02 seconds.
% 1.42/1.71
% 1.42/1.71 ============================== PROOF =================================
% 1.42/1.71 % SZS status Unsatisfiable
% 1.42/1.71 % SZS output start Refutation
% 1.42/1.71
% 1.42/1.71 % Proof 1 at 0.73 (+ 0.00) seconds.
% 1.42/1.71 % Length of proof is 16.
% 1.42/1.71 % Level of proof is 3.
% 1.42/1.71 % Maximum clause weight is 36.000.
% 1.42/1.71 % Given clauses 162.
% 1.42/1.71
% 1.42/1.71 3 between(u,v,w) # label(v_between_u_and_w) # label(hypothesis). [assumption].
% 1.42/1.71 5 equidistant(A,B,A,B) # label(d1) # label(axiom). [assumption].
% 1.42/1.71 9 equidistant(u,w,u,w1) # label(u_to_w_equals_u_to_w1) # label(hypothesis). [assumption].
% 1.42/1.71 10 equidistant(v,w,v,w1) # label(v_to_w_equals_v_to_w1) # label(hypothesis). [assumption].
% 1.42/1.71 31 u != v # label(u_not_v) # label(hypothesis). [assumption].
% 1.42/1.71 32 v != u. [copy(31),flip(a)].
% 1.42/1.71 33 w != w1 # label(prove_w_is_w1) # label(negated_conjecture). [assumption].
% 1.42/1.71 34 w1 != w. [copy(33),flip(a)].
% 1.42/1.71 41 -equidistant(A,B,C,C) | A = B # label(identity_for_equidistance) # label(axiom). [assumption].
% 1.42/1.71 47 -equidistant(A,B,C,D) | equidistant(C,D,A,B) # label(d2) # label(axiom). [assumption].
% 1.42/1.71 79 -equidistant(A,B,C,D) | -equidistant(B,E,D,F) | -equidistant(A,V6,C,V7) | -equidistant(B,V6,D,V7) | -between(A,B,E) | -between(C,D,F) | A = B | equidistant(E,V6,F,V7) # label(outer_five_segment) # label(axiom). [assumption].
% 1.42/1.71 89 -equidistant(A,B,A,C) | -equidistant(D,B,D,C) | -between(A,D,E) | A = D | equidistant(E,B,E,C). [factor(79,e,f),unit_del(a,5),unit_del(b,5)].
% 1.42/1.71 127 -equidistant(w,w1,A,A). [ur(41,b,34,a(flip))].
% 1.42/1.71 151 equidistant(v,w1,v,w). [resolve(47,a,10,a)].
% 1.42/1.71 152 equidistant(u,w1,u,w). [resolve(47,a,9,a)].
% 1.42/1.71 1100 $F. [ur(89,b,151,a,c,3,a,d,32,a(flip),e,127,a),unit_del(a,152)].
% 1.42/1.71
% 1.42/1.71 % SZS output end Refutation
% 1.42/1.71 ============================== end of proof ==========================
% 1.42/1.71
% 1.42/1.71 ============================== STATISTICS ============================
% 1.42/1.71
% 1.42/1.71 Given=162. Generated=3330. Kept=1084. proofs=1.
% 1.42/1.71 Usable=161. Sos=841. Demods=4. Limbo=2, Disabled=149. Hints=0.
% 1.42/1.71 Megabytes=0.97.
% 1.42/1.71 User_CPU=0.73, System_CPU=0.00, Wall_clock=1.
% 1.42/1.71
% 1.42/1.71 ============================== end of statistics =====================
% 1.42/1.71
% 1.42/1.71 ============================== end of search =========================
% 1.42/1.71
% 1.42/1.71 THEOREM PROVED
% 1.42/1.71 % SZS status Unsatisfiable
% 1.42/1.71
% 1.42/1.71 Exiting with 1 proof.
% 1.42/1.71
% 1.42/1.71 Process 14502 exit (max_proofs) Sat Jun 18 08:58:59 2022
% 1.42/1.71 Prover9 interrupted
%------------------------------------------------------------------------------