TSTP Solution File: GEO034-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO034-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:25 EDT 2022
% Result : Unsatisfiable 2.26s 2.52s
% Output : Refutation 2.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : GEO034-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.09/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 18 02:54:47 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.26/2.52 ============================== Prover9 ===============================
% 2.26/2.52 Prover9 (32) version 2009-11A, November 2009.
% 2.26/2.52 Process 27564 was started by sandbox2 on n024.cluster.edu,
% 2.26/2.52 Sat Jun 18 02:54:48 2022
% 2.26/2.52 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27411_n024.cluster.edu".
% 2.26/2.52 ============================== end of head ===========================
% 2.26/2.52
% 2.26/2.52 ============================== INPUT =================================
% 2.26/2.52
% 2.26/2.52 % Reading from file /tmp/Prover9_27411_n024.cluster.edu
% 2.26/2.52
% 2.26/2.52 set(prolog_style_variables).
% 2.26/2.52 set(auto2).
% 2.26/2.52 % set(auto2) -> set(auto).
% 2.26/2.52 % set(auto) -> set(auto_inference).
% 2.26/2.52 % set(auto) -> set(auto_setup).
% 2.26/2.52 % set(auto_setup) -> set(predicate_elim).
% 2.26/2.52 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.26/2.52 % set(auto) -> set(auto_limits).
% 2.26/2.52 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.26/2.52 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.26/2.52 % set(auto) -> set(auto_denials).
% 2.26/2.52 % set(auto) -> set(auto_process).
% 2.26/2.52 % set(auto2) -> assign(new_constants, 1).
% 2.26/2.52 % set(auto2) -> assign(fold_denial_max, 3).
% 2.26/2.52 % set(auto2) -> assign(max_weight, "200.000").
% 2.26/2.52 % set(auto2) -> assign(max_hours, 1).
% 2.26/2.52 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.26/2.52 % set(auto2) -> assign(max_seconds, 0).
% 2.26/2.52 % set(auto2) -> assign(max_minutes, 5).
% 2.26/2.52 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.26/2.52 % set(auto2) -> set(sort_initial_sos).
% 2.26/2.52 % set(auto2) -> assign(sos_limit, -1).
% 2.26/2.52 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.26/2.52 % set(auto2) -> assign(max_megs, 400).
% 2.26/2.52 % set(auto2) -> assign(stats, some).
% 2.26/2.52 % set(auto2) -> clear(echo_input).
% 2.26/2.52 % set(auto2) -> set(quiet).
% 2.26/2.52 % set(auto2) -> clear(print_initial_clauses).
% 2.26/2.52 % set(auto2) -> clear(print_given).
% 2.26/2.52 assign(lrs_ticks,-1).
% 2.26/2.52 assign(sos_limit,10000).
% 2.26/2.52 assign(order,kbo).
% 2.26/2.52 set(lex_order_vars).
% 2.26/2.52 clear(print_given).
% 2.26/2.52
% 2.26/2.52 % formulas(sos). % not echoed (72 formulas)
% 2.26/2.52
% 2.26/2.52 ============================== end of input ==========================
% 2.26/2.52
% 2.26/2.52 % From the command line: assign(max_seconds, 300).
% 2.26/2.52
% 2.26/2.52 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.26/2.52
% 2.26/2.52 % Formulas that are not ordinary clauses:
% 2.26/2.52
% 2.26/2.52 ============================== end of process non-clausal formulas ===
% 2.26/2.52
% 2.26/2.52 ============================== PROCESS INITIAL CLAUSES ===============
% 2.26/2.52
% 2.26/2.52 ============================== PREDICATE ELIMINATION =================
% 2.26/2.52
% 2.26/2.52 ============================== end predicate elimination =============
% 2.26/2.52
% 2.26/2.52 Auto_denials: (non-Horn, no changes).
% 2.26/2.52
% 2.26/2.52 Term ordering decisions:
% 2.26/2.52 Function symbol KB weights: lower_dimension_point_1=1. lower_dimension_point_2=1. u=1. v=1. w=1. x=1. lower_dimension_point_3=1. reflection=1. extension=1. inner_pasch=1. euclid1=1. euclid2=1. continuous=1.
% 2.26/2.52
% 2.26/2.52 ============================== end of process initial clauses ========
% 2.26/2.52
% 2.26/2.52 ============================== CLAUSES FOR SEARCH ====================
% 2.26/2.52
% 2.26/2.52 ============================== end of clauses for search =============
% 2.26/2.52
% 2.26/2.52 ============================== SEARCH ================================
% 2.26/2.52
% 2.26/2.52 % Starting search at 0.02 seconds.
% 2.26/2.52
% 2.26/2.52 ============================== PROOF =================================
% 2.26/2.52 % SZS status Unsatisfiable
% 2.26/2.52 % SZS output start Refutation
% 2.26/2.52
% 2.26/2.52 % Proof 1 at 1.54 (+ 0.01) seconds.
% 2.26/2.52 % Length of proof is 16.
% 2.26/2.52 % Level of proof is 3.
% 2.26/2.52 % Maximum clause weight is 33.000.
% 2.26/2.52 % Given clauses 194.
% 2.26/2.52
% 2.26/2.52 3 between(u,v,w) # label(v_between_u_and_w) # label(hypothesis). [assumption].
% 2.26/2.52 5 equidistant(A,B,A,B) # label(d1) # label(axiom). [assumption].
% 2.26/2.52 9 equidistant(u,v,u,x) # label(u_to_v_equals_u_to_x) # label(hypothesis). [assumption].
% 2.26/2.52 10 equidistant(w,v,w,x) # label(w_to_v_equals_w_to_x) # label(hypothesis). [assumption].
% 2.26/2.52 31 v != x # label(prove_v_is_x) # label(negated_conjecture). [assumption].
% 2.26/2.52 32 x != v. [copy(31),flip(a)].
% 2.26/2.52 39 -equidistant(A,B,C,C) | A = B # label(identity_for_equidistance) # label(axiom). [assumption].
% 2.26/2.52 44 -between(A,B,C) | between(C,B,A) # label(t1) # label(axiom). [assumption].
% 2.26/2.52 45 -equidistant(A,B,C,D) | equidistant(C,D,A,B) # label(d2) # label(axiom). [assumption].
% 2.26/2.52 79 -equidistant(A,B,C,D) | -equidistant(A,E,C,F) | -equidistant(A,V6,C,V7) | -equidistant(E,V6,F,V7) | -between(A,B,E) | -between(C,D,F) | equidistant(B,V6,D,V7) # label(d12) # label(axiom). [assumption].
% 2.26/2.52 92 -equidistant(A,B,A,C) | -equidistant(D,B,D,C) | -between(A,E,D) | equidistant(E,B,E,C). [factor(79,e,f),unit_del(a,5),unit_del(b,5)].
% 2.26/2.52 129 -equidistant(v,x,A,A). [ur(39,b,32,a(flip))].
% 2.26/2.52 145 between(w,v,u). [resolve(44,a,3,a)].
% 2.26/2.52 150 equidistant(w,x,w,v). [resolve(45,a,10,a)].
% 2.26/2.52 151 equidistant(u,x,u,v). [resolve(45,a,9,a)].
% 2.26/2.52 1698 $F. [ur(92,b,151,a,c,145,a,d,129,a),unit_del(a,150)].
% 2.26/2.52
% 2.26/2.52 % SZS output end Refutation
% 2.26/2.52 ============================== end of proof ==========================
% 2.26/2.52
% 2.26/2.52 ============================== STATISTICS ============================
% 2.26/2.52
% 2.26/2.52 Given=194. Generated=5426. Kept=1683. proofs=1.
% 2.26/2.52 Usable=187. Sos=1364. Demods=6. Limbo=2, Disabled=202. Hints=0.
% 2.26/2.52 Megabytes=1.46.
% 2.26/2.52 User_CPU=1.54, System_CPU=0.01, Wall_clock=2.
% 2.26/2.52
% 2.26/2.52 ============================== end of statistics =====================
% 2.26/2.52
% 2.26/2.52 ============================== end of search =========================
% 2.26/2.52
% 2.26/2.52 THEOREM PROVED
% 2.26/2.52 % SZS status Unsatisfiable
% 2.26/2.52
% 2.26/2.52 Exiting with 1 proof.
% 2.26/2.52
% 2.26/2.52 Process 27564 exit (max_proofs) Sat Jun 18 02:54:50 2022
% 2.26/2.52 Prover9 interrupted
%------------------------------------------------------------------------------