TSTP Solution File: GEO001-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO001-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:04 EDT 2022
% Result : Unsatisfiable 0.99s 1.28s
% Output : Refutation 0.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO001-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n004.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 13:18:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.99/1.28 ============================== Prover9 ===============================
% 0.99/1.28 Prover9 (32) version 2009-11A, November 2009.
% 0.99/1.28 Process 13575 was started by sandbox on n004.cluster.edu,
% 0.99/1.28 Sat Jun 18 13:18:39 2022
% 0.99/1.28 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13422_n004.cluster.edu".
% 0.99/1.28 ============================== end of head ===========================
% 0.99/1.28
% 0.99/1.28 ============================== INPUT =================================
% 0.99/1.28
% 0.99/1.28 % Reading from file /tmp/Prover9_13422_n004.cluster.edu
% 0.99/1.28
% 0.99/1.28 set(prolog_style_variables).
% 0.99/1.28 set(auto2).
% 0.99/1.28 % set(auto2) -> set(auto).
% 0.99/1.28 % set(auto) -> set(auto_inference).
% 0.99/1.28 % set(auto) -> set(auto_setup).
% 0.99/1.28 % set(auto_setup) -> set(predicate_elim).
% 0.99/1.28 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.99/1.28 % set(auto) -> set(auto_limits).
% 0.99/1.28 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.99/1.28 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.99/1.28 % set(auto) -> set(auto_denials).
% 0.99/1.28 % set(auto) -> set(auto_process).
% 0.99/1.28 % set(auto2) -> assign(new_constants, 1).
% 0.99/1.28 % set(auto2) -> assign(fold_denial_max, 3).
% 0.99/1.28 % set(auto2) -> assign(max_weight, "200.000").
% 0.99/1.28 % set(auto2) -> assign(max_hours, 1).
% 0.99/1.28 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.99/1.28 % set(auto2) -> assign(max_seconds, 0).
% 0.99/1.28 % set(auto2) -> assign(max_minutes, 5).
% 0.99/1.28 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.99/1.28 % set(auto2) -> set(sort_initial_sos).
% 0.99/1.28 % set(auto2) -> assign(sos_limit, -1).
% 0.99/1.28 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.99/1.28 % set(auto2) -> assign(max_megs, 400).
% 0.99/1.28 % set(auto2) -> assign(stats, some).
% 0.99/1.28 % set(auto2) -> clear(echo_input).
% 0.99/1.28 % set(auto2) -> set(quiet).
% 0.99/1.28 % set(auto2) -> clear(print_initial_clauses).
% 0.99/1.28 % set(auto2) -> clear(print_given).
% 0.99/1.28 assign(lrs_ticks,-1).
% 0.99/1.28 assign(sos_limit,10000).
% 0.99/1.28 assign(order,kbo).
% 0.99/1.28 set(lex_order_vars).
% 0.99/1.28 clear(print_given).
% 0.99/1.28
% 0.99/1.28 % formulas(sos). % not echoed (20 formulas)
% 0.99/1.28
% 0.99/1.28 ============================== end of input ==========================
% 0.99/1.28
% 0.99/1.28 % From the command line: assign(max_seconds, 300).
% 0.99/1.28
% 0.99/1.28 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.99/1.28
% 0.99/1.28 % Formulas that are not ordinary clauses:
% 0.99/1.28
% 0.99/1.28 ============================== end of process non-clausal formulas ===
% 0.99/1.28
% 0.99/1.28 ============================== PROCESS INITIAL CLAUSES ===============
% 0.99/1.28
% 0.99/1.28 ============================== PREDICATE ELIMINATION =================
% 0.99/1.28
% 0.99/1.28 ============================== end predicate elimination =============
% 0.99/1.28
% 0.99/1.28 Auto_denials: (non-Horn, no changes).
% 0.99/1.28
% 0.99/1.28 Term ordering decisions:
% 0.99/1.28 Function symbol KB weights: a=1. b=1. c=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.99/1.28
% 0.99/1.28 ============================== end of process initial clauses ========
% 0.99/1.28
% 0.99/1.28 ============================== CLAUSES FOR SEARCH ====================
% 0.99/1.28
% 0.99/1.28 ============================== end of clauses for search =============
% 0.99/1.28
% 0.99/1.28 ============================== SEARCH ================================
% 0.99/1.28
% 0.99/1.28 % Starting search at 0.01 seconds.
% 0.99/1.28
% 0.99/1.28 ============================== PROOF =================================
% 0.99/1.28 % SZS status Unsatisfiable
% 0.99/1.28 % SZS output start Refutation
% 0.99/1.28
% 0.99/1.28 % Proof 1 at 0.30 (+ 0.01) seconds.
% 0.99/1.28 % Length of proof is 16.
% 0.99/1.28 % Level of proof is 5.
% 0.99/1.28 % Maximum clause weight is 17.000.
% 0.99/1.28 % Given clauses 72.
% 0.99/1.28
% 0.99/1.28 1 between(a,b,c) # label(b_between_a_and_c) # label(hypothesis). [assumption].
% 0.99/1.28 3 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom). [assumption].
% 0.99/1.28 4 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom). [assumption].
% 0.99/1.28 8 -between(c,b,a) # label(prove_b_between_c_and_a) # label(negated_conjecture). [assumption].
% 0.99/1.28 9 -between(A,B,A) | A = B # label(identity_for_betweeness) # label(axiom). [assumption].
% 0.99/1.28 10 -equidistant(A,B,C,C) | A = B # label(identity_for_equidistance) # label(axiom). [assumption].
% 0.99/1.28 12 -between(A,B,C) | -between(D,E,C) | between(B,inner_pasch(A,B,C,E,D),D) # label(inner_pasch1) # label(axiom). [assumption].
% 0.99/1.28 13 -between(A,B,C) | -between(D,E,C) | between(E,inner_pasch(A,B,C,E,D),A) # label(inner_pasch2) # label(axiom). [assumption].
% 0.99/1.28 38 extension(A,B,C,C) = B. [resolve(10,a,4,a),flip(a)].
% 0.99/1.28 44 -between(A,B,c) | between(b,inner_pasch(a,b,c,B,A),A). [resolve(12,a,1,a)].
% 0.99/1.28 48 -between(A,B,c) | between(B,inner_pasch(a,b,c,B,A),a). [resolve(13,a,1,a)].
% 0.99/1.28 120 between(A,B,B). [para(38(a,1),3(a,3))].
% 0.99/1.28 311 between(b,inner_pasch(a,b,c,c,A),A). [resolve(44,a,120,a)].
% 0.99/1.28 328 inner_pasch(a,b,c,c,b) = b. [resolve(311,a,9,a),flip(a)].
% 0.99/1.28 390 between(c,inner_pasch(a,b,c,c,A),a). [resolve(48,a,120,a)].
% 0.99/1.28 408 $F. [para(328(a,1),390(a,2)),unit_del(a,8)].
% 0.99/1.28
% 0.99/1.28 % SZS output end Refutation
% 0.99/1.28 ============================== end of proof ==========================
% 0.99/1.28
% 0.99/1.28 ============================== STATISTICS ============================
% 0.99/1.28
% 0.99/1.28 Given=72. Generated=739. Kept=407. proofs=1.
% 0.99/1.28 Usable=62. Sos=272. Demods=4. Limbo=14, Disabled=79. Hints=0.
% 0.99/1.28 Megabytes=0.46.
% 0.99/1.28 User_CPU=0.30, System_CPU=0.01, Wall_clock=0.
% 0.99/1.28
% 0.99/1.28 ============================== end of statistics =====================
% 0.99/1.28
% 0.99/1.28 ============================== end of search =========================
% 0.99/1.28
% 0.99/1.28 THEOREM PROVED
% 0.99/1.28 % SZS status Unsatisfiable
% 0.99/1.28
% 0.99/1.28 Exiting with 1 proof.
% 0.99/1.28
% 0.99/1.28 Process 13575 exit (max_proofs) Sat Jun 18 13:18:39 2022
% 0.99/1.28 Prover9 interrupted
%------------------------------------------------------------------------------