TSTP Solution File: GEO030-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO030-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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 0.45s 0.84s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : GEO030-2 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.08 % Command : tptp2X_and_run_prover9 %d %s
% 0.06/0.26 % Computer : n032.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Fri Jun 17 16:36:31 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.45/0.84 ============================== Prover9 ===============================
% 0.45/0.84 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.84 Process 440 was started by sandbox2 on n032.cluster.edu,
% 0.45/0.84 Fri Jun 17 16:36:31 2022
% 0.45/0.84 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32755_n032.cluster.edu".
% 0.45/0.84 ============================== end of head ===========================
% 0.45/0.84
% 0.45/0.84 ============================== INPUT =================================
% 0.45/0.84
% 0.45/0.84 % Reading from file /tmp/Prover9_32755_n032.cluster.edu
% 0.45/0.84
% 0.45/0.84 set(prolog_style_variables).
% 0.45/0.84 set(auto2).
% 0.45/0.84 % set(auto2) -> set(auto).
% 0.45/0.84 % set(auto) -> set(auto_inference).
% 0.45/0.84 % set(auto) -> set(auto_setup).
% 0.45/0.84 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.84 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.84 % set(auto) -> set(auto_limits).
% 0.45/0.84 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.84 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.84 % set(auto) -> set(auto_denials).
% 0.45/0.84 % set(auto) -> set(auto_process).
% 0.45/0.84 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.84 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.84 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.84 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.84 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.84 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.84 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.84 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.84 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.84 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.84 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.84 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.84 % set(auto2) -> assign(stats, some).
% 0.45/0.84 % set(auto2) -> clear(echo_input).
% 0.45/0.84 % set(auto2) -> set(quiet).
% 0.45/0.84 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.84 % set(auto2) -> clear(print_given).
% 0.45/0.84 assign(lrs_ticks,-1).
% 0.45/0.84 assign(sos_limit,10000).
% 0.45/0.84 assign(order,kbo).
% 0.45/0.84 set(lex_order_vars).
% 0.45/0.84 clear(print_given).
% 0.45/0.84
% 0.45/0.84 % formulas(sos). % not echoed (23 formulas)
% 0.45/0.84
% 0.45/0.84 ============================== end of input ==========================
% 0.45/0.84
% 0.45/0.84 % From the command line: assign(max_seconds, 300).
% 0.45/0.84
% 0.45/0.84 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.84
% 0.45/0.84 % Formulas that are not ordinary clauses:
% 0.45/0.84
% 0.45/0.84 ============================== end of process non-clausal formulas ===
% 0.45/0.84
% 0.45/0.84 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.84
% 0.45/0.84 ============================== PREDICATE ELIMINATION =================
% 0.45/0.84
% 0.45/0.84 ============================== end predicate elimination =============
% 0.45/0.84
% 0.45/0.84 Auto_denials: (non-Horn, no changes).
% 0.45/0.84
% 0.45/0.84 Term ordering decisions:
% 0.45/0.84 Function symbol KB weights: u=1. v=1. w=1. w1=1. lower_dimension_point_1=1. lower_dimension_point_2=1. lower_dimension_point_3=1. extension=1. euclid1=1. euclid2=1. inner_pasch=1. continuous=1.
% 0.45/0.84
% 0.45/0.84 ============================== end of process initial clauses ========
% 0.45/0.84
% 0.45/0.84 ============================== CLAUSES FOR SEARCH ====================
% 0.45/0.84
% 0.45/0.84 ============================== end of clauses for search =============
% 0.45/0.84
% 0.45/0.84 ============================== SEARCH ================================
% 0.45/0.84
% 0.45/0.84 % Starting search at 0.01 seconds.
% 0.45/0.84
% 0.45/0.84 ============================== PROOF =================================
% 0.45/0.84 % SZS status Unsatisfiable
% 0.45/0.84 % SZS output start Refutation
% 0.45/0.84
% 0.45/0.84 % Proof 1 at 0.10 (+ 0.00) seconds.
% 0.45/0.84 % Length of proof is 16.
% 0.45/0.84 % Level of proof is 4.
% 0.45/0.84 % Maximum clause weight is 36.000.
% 0.45/0.84 % Given clauses 59.
% 0.45/0.84
% 0.45/0.84 1 between(u,v,w) # label(v_between_u_and_w) # label(hypothesis). [assumption].
% 0.45/0.84 3 equidistant(u,w,u,w1) # label(u_to_w_equals_u_to_w1) # label(hypothesis). [assumption].
% 0.45/0.84 4 equidistant(v,w,v,w1) # label(v_to_w_equals_v_to_w1) # label(hypothesis). [assumption].
% 0.45/0.84 6 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom). [assumption].
% 0.45/0.84 7 u != v # label(u_not_v) # label(hypothesis). [assumption].
% 0.45/0.84 8 v != u. [copy(7),flip(a)].
% 0.45/0.84 9 w != w1 # label(prove_w_is_w1) # label(negated_conjecture). [assumption].
% 0.45/0.84 10 w1 != w. [copy(9),flip(a)].
% 0.45/0.84 15 -equidistant(A,B,C,C) | A = B # label(identity_for_equidistance) # label(axiom). [assumption].
% 0.45/0.84 16 -equidistant(A,B,C,D) | -equidistant(A,B,E,F) | equidistant(C,D,E,F) # label(transitivity_for_equidistance) # label(axiom). [assumption].
% 0.45/0.84 25 -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].
% 0.45/0.84 26 -equidistant(A,B,C,D) | equidistant(C,D,C,D). [factor(16,a,b)].
% 0.45/0.84 50 -equidistant(w,w1,A,A). [ur(15,b,10,a(flip))].
% 0.45/0.84 150 equidistant(A,B,A,B). [resolve(26,a,6,a)].
% 0.45/0.84 245 -equidistant(A,A,w,w1). [ur(16,b,150,a,c,50,a)].
% 0.45/0.84 292 $F. [ur(25,b,150,a,c,3,a,d,4,a,e,1,a,f,1,a,g,8,a(flip),h,245,a),unit_del(a,150)].
% 0.45/0.84
% 0.45/0.84 % SZS output end Refutation
% 0.45/0.84 ============================== end of proof ==========================
% 0.45/0.84
% 0.45/0.84 ============================== STATISTICS ============================
% 0.45/0.84
% 0.45/0.84 Given=59. Generated=568. Kept=289. proofs=1.
% 0.45/0.84 Usable=48. Sos=167. Demods=1. Limbo=0, Disabled=97. Hints=0.
% 0.45/0.84 Megabytes=0.32.
% 0.45/0.84 User_CPU=0.10, System_CPU=0.00, Wall_clock=0.
% 0.45/0.84
% 0.45/0.84 ============================== end of statistics =====================
% 0.45/0.84
% 0.45/0.84 ============================== end of search =========================
% 0.45/0.84
% 0.45/0.84 THEOREM PROVED
% 0.45/0.84 % SZS status Unsatisfiable
% 0.45/0.84
% 0.45/0.84 Exiting with 1 proof.
% 0.45/0.84
% 0.45/0.84 Process 440 exit (max_proofs) Fri Jun 17 16:36:31 2022
% 0.45/0.84 Prover9 interrupted
%------------------------------------------------------------------------------