TSTP Solution File: GEO002-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO002-1 : TPTP v8.1.0. Bugfixed v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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:05 EDT 2022
% Result : Unsatisfiable 0.72s 1.03s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GEO002-1 : TPTP v8.1.0. Bugfixed v2.5.0.
% 0.08/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 14:00:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.03 ============================== Prover9 ===============================
% 0.72/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.03 Process 18641 was started by sandbox2 on n005.cluster.edu,
% 0.72/1.03 Sat Jun 18 14:00:09 2022
% 0.72/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18488_n005.cluster.edu".
% 0.72/1.03 ============================== end of head ===========================
% 0.72/1.03
% 0.72/1.03 ============================== INPUT =================================
% 0.72/1.03
% 0.72/1.03 % Reading from file /tmp/Prover9_18488_n005.cluster.edu
% 0.72/1.03
% 0.72/1.03 set(prolog_style_variables).
% 0.72/1.03 set(auto2).
% 0.72/1.03 % set(auto2) -> set(auto).
% 0.72/1.03 % set(auto) -> set(auto_inference).
% 0.72/1.03 % set(auto) -> set(auto_setup).
% 0.72/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.03 % set(auto) -> set(auto_limits).
% 0.72/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.03 % set(auto) -> set(auto_denials).
% 0.72/1.03 % set(auto) -> set(auto_process).
% 0.72/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.03 % set(auto2) -> assign(stats, some).
% 0.72/1.03 % set(auto2) -> clear(echo_input).
% 0.72/1.03 % set(auto2) -> set(quiet).
% 0.72/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.03 % set(auto2) -> clear(print_given).
% 0.72/1.03 assign(lrs_ticks,-1).
% 0.72/1.03 assign(sos_limit,10000).
% 0.72/1.03 assign(order,kbo).
% 0.72/1.03 set(lex_order_vars).
% 0.72/1.03 clear(print_given).
% 0.72/1.03
% 0.72/1.03 % formulas(sos). % not echoed (21 formulas)
% 0.72/1.03
% 0.72/1.03 ============================== end of input ==========================
% 0.72/1.03
% 0.72/1.03 % From the command line: assign(max_seconds, 300).
% 0.72/1.03
% 0.72/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.03
% 0.72/1.03 % Formulas that are not ordinary clauses:
% 0.72/1.03
% 0.72/1.03 ============================== end of process non-clausal formulas ===
% 0.72/1.03
% 0.72/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.03
% 0.72/1.03 ============================== PREDICATE ELIMINATION =================
% 0.72/1.03
% 0.72/1.03 ============================== end predicate elimination =============
% 0.72/1.03
% 0.72/1.03 Auto_denials: (non-Horn, no changes).
% 0.72/1.03
% 0.72/1.03 Term ordering decisions:
% 0.72/1.03 Function symbol KB weights: a=1. b=1. lower_dimension_point_1=1. lower_dimension_point_2=1. lower_dimension_point_3=1. extension=1. euclid1=1. euclid2=1. outer_pasch=1. continuous=1.
% 0.72/1.03
% 0.72/1.03 ============================== end of process initial clauses ========
% 0.72/1.03
% 0.72/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.03
% 0.72/1.03 ============================== end of clauses for search =============
% 0.72/1.03
% 0.72/1.03 ============================== SEARCH ================================
% 0.72/1.03
% 0.72/1.03 % Starting search at 0.01 seconds.
% 0.72/1.03
% 0.72/1.03 ============================== PROOF =================================
% 0.72/1.03 % SZS status Unsatisfiable
% 0.72/1.03 % SZS output start Refutation
% 0.72/1.03
% 0.72/1.03 % Proof 1 at 0.06 (+ 0.00) seconds.
% 0.72/1.03 % Length of proof is 17.
% 0.72/1.03 % Level of proof is 5.
% 0.72/1.03 % Maximum clause weight is 17.000.
% 0.72/1.03 % Given clauses 52.
% 0.72/1.03
% 0.72/1.03 2 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom). [assumption].
% 0.72/1.03 3 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom). [assumption].
% 0.72/1.03 7 -between(a,a,b) # label(prove_a_between_a_and_b) # label(negated_conjecture). [assumption].
% 0.72/1.03 9 -equidistant(A,B,C,C) | A = B # label(identity_for_equidistance) # label(axiom). [assumption].
% 0.72/1.03 10 -between(A,B,C) | -between(B,D,C) | between(A,B,D) # label(transitivity_for_betweeness) # label(axiom). [assumption].
% 0.72/1.03 12 -between(A,B,C) | -between(D,C,E) | between(A,outer_pasch(B,A,D,E,C),D) # label(outer_pasch1) # label(axiom). [assumption].
% 0.72/1.03 13 -between(A,B,C) | -between(D,C,E) | between(E,B,outer_pasch(B,A,D,E,C)) # label(outer_pasch2) # label(axiom). [assumption].
% 0.72/1.03 24 -between(A,B,B) | between(A,outer_pasch(B,A,A,B,B),A). [factor(12,a,b)].
% 0.72/1.03 25 -between(A,B,B) | between(B,B,outer_pasch(B,A,A,B,B)). [factor(13,a,b)].
% 0.72/1.03 42 extension(A,B,C,C) = B. [resolve(9,a,3,a),flip(a)].
% 0.72/1.03 124 between(A,B,B). [para(42(a,1),2(a,3))].
% 0.72/1.03 130 between(A,A,outer_pasch(A,B,B,A,A)). [back_unit_del(25),unit_del(a,124)].
% 0.72/1.03 131 between(A,outer_pasch(B,A,A,B,B),A). [back_unit_del(24),unit_del(a,124)].
% 0.72/1.03 157 -between(A,B,A) | between(C,A,B). [resolve(124,a,10,a)].
% 0.72/1.03 201 -between(a,b,outer_pasch(a,A,A,a,a)). [ur(10,a,130,a,c,7,a)].
% 0.72/1.03 202 between(A,B,outer_pasch(C,B,B,C,C)). [resolve(131,a,157,a)].
% 0.72/1.03 203 $F. [resolve(202,a,201,a)].
% 0.72/1.03
% 0.72/1.03 % SZS output end Refutation
% 0.72/1.03 ============================== end of proof ==========================
% 0.72/1.03
% 0.72/1.03 ============================== STATISTICS ============================
% 0.72/1.03
% 0.72/1.03 Given=52. Generated=406. Kept=202. proofs=1.
% 0.72/1.03 Usable=42. Sos=118. Demods=1. Limbo=0, Disabled=62. Hints=0.
% 0.72/1.03 Megabytes=0.20.
% 0.72/1.03 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.72/1.03
% 0.72/1.03 ============================== end of statistics =====================
% 0.72/1.03
% 0.72/1.03 ============================== end of search =========================
% 0.72/1.03
% 0.72/1.03 THEOREM PROVED
% 0.72/1.03 % SZS status Unsatisfiable
% 0.72/1.03
% 0.72/1.03 Exiting with 1 proof.
% 0.72/1.03
% 0.72/1.03 Process 18641 exit (max_proofs) Sat Jun 18 14:00:09 2022
% 0.72/1.03 Prover9 interrupted
%------------------------------------------------------------------------------