TSTP Solution File: GEO048-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO048-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:32 EDT 2022
% Result : Unsatisfiable 1.17s 1.49s
% Output : Refutation 1.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO048-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.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 18:17:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.17/1.49 ============================== Prover9 ===============================
% 1.17/1.49 Prover9 (32) version 2009-11A, November 2009.
% 1.17/1.49 Process 2618 was started by sandbox on n025.cluster.edu,
% 1.17/1.49 Sat Jun 18 18:17:14 2022
% 1.17/1.49 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2464_n025.cluster.edu".
% 1.17/1.49 ============================== end of head ===========================
% 1.17/1.49
% 1.17/1.49 ============================== INPUT =================================
% 1.17/1.49
% 1.17/1.49 % Reading from file /tmp/Prover9_2464_n025.cluster.edu
% 1.17/1.49
% 1.17/1.49 set(prolog_style_variables).
% 1.17/1.49 set(auto2).
% 1.17/1.49 % set(auto2) -> set(auto).
% 1.17/1.49 % set(auto) -> set(auto_inference).
% 1.17/1.49 % set(auto) -> set(auto_setup).
% 1.17/1.49 % set(auto_setup) -> set(predicate_elim).
% 1.17/1.49 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.17/1.49 % set(auto) -> set(auto_limits).
% 1.17/1.49 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.17/1.49 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.17/1.49 % set(auto) -> set(auto_denials).
% 1.17/1.49 % set(auto) -> set(auto_process).
% 1.17/1.49 % set(auto2) -> assign(new_constants, 1).
% 1.17/1.49 % set(auto2) -> assign(fold_denial_max, 3).
% 1.17/1.49 % set(auto2) -> assign(max_weight, "200.000").
% 1.17/1.49 % set(auto2) -> assign(max_hours, 1).
% 1.17/1.49 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.17/1.49 % set(auto2) -> assign(max_seconds, 0).
% 1.17/1.49 % set(auto2) -> assign(max_minutes, 5).
% 1.17/1.49 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.17/1.49 % set(auto2) -> set(sort_initial_sos).
% 1.17/1.49 % set(auto2) -> assign(sos_limit, -1).
% 1.17/1.49 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.17/1.49 % set(auto2) -> assign(max_megs, 400).
% 1.17/1.49 % set(auto2) -> assign(stats, some).
% 1.17/1.49 % set(auto2) -> clear(echo_input).
% 1.17/1.49 % set(auto2) -> set(quiet).
% 1.17/1.49 % set(auto2) -> clear(print_initial_clauses).
% 1.17/1.49 % set(auto2) -> clear(print_given).
% 1.17/1.49 assign(lrs_ticks,-1).
% 1.17/1.49 assign(sos_limit,10000).
% 1.17/1.49 assign(order,kbo).
% 1.17/1.49 set(lex_order_vars).
% 1.17/1.49 clear(print_given).
% 1.17/1.49
% 1.17/1.49 % formulas(sos). % not echoed (23 formulas)
% 1.17/1.49
% 1.17/1.49 ============================== end of input ==========================
% 1.17/1.49
% 1.17/1.49 % From the command line: assign(max_seconds, 300).
% 1.17/1.49
% 1.17/1.49 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.17/1.49
% 1.17/1.49 % Formulas that are not ordinary clauses:
% 1.17/1.49
% 1.17/1.49 ============================== end of process non-clausal formulas ===
% 1.17/1.49
% 1.17/1.49 ============================== PROCESS INITIAL CLAUSES ===============
% 1.17/1.49
% 1.17/1.49 ============================== PREDICATE ELIMINATION =================
% 1.17/1.49
% 1.17/1.49 ============================== end predicate elimination =============
% 1.17/1.49
% 1.17/1.49 Auto_denials: (non-Horn, no changes).
% 1.17/1.49
% 1.17/1.49 Term ordering decisions:
% 1.17/1.49 Function symbol KB weights: u=1. u1=1. w=1. v=1. v1=1. x=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.
% 1.17/1.49
% 1.17/1.49 ============================== end of process initial clauses ========
% 1.17/1.49
% 1.17/1.49 ============================== CLAUSES FOR SEARCH ====================
% 1.17/1.49
% 1.17/1.49 ============================== end of clauses for search =============
% 1.17/1.49
% 1.17/1.49 ============================== SEARCH ================================
% 1.17/1.49
% 1.17/1.49 % Starting search at 0.01 seconds.
% 1.17/1.49
% 1.17/1.49 ============================== PROOF =================================
% 1.17/1.49 % SZS status Unsatisfiable
% 1.17/1.49 % SZS output start Refutation
% 1.17/1.49
% 1.17/1.49 % Proof 1 at 0.54 (+ 0.01) seconds.
% 1.17/1.49 % Length of proof is 27.
% 1.17/1.49 % Level of proof is 7.
% 1.17/1.49 % Maximum clause weight is 17.000.
% 1.17/1.49 % Given clauses 105.
% 1.17/1.49
% 1.17/1.49 1 between(u,v,w) # label(v_between_u_and_w) # label(hypothesis). [assumption].
% 1.17/1.49 2 between(u1,v1,w) # label(v1_between_u1_and_w) # label(hypothesis). [assumption].
% 1.17/1.49 3 between(u,x,u1) # label(x_between_u_and_u1) # label(hypothesis). [assumption].
% 1.17/1.49 5 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom). [assumption].
% 1.17/1.49 6 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom). [assumption].
% 1.17/1.49 11 -between(v,inner_pasch(v1,inner_pasch(u,x,u1,v1,w),u,v,w),v1) # label(prove_conclusion2) # label(negated_conjecture). [assumption].
% 1.17/1.49 12 -between(A,B,A) | A = B # label(identity_for_betweeness) # label(axiom). [assumption].
% 1.17/1.49 13 -equidistant(A,B,C,C) | A = B # label(identity_for_equidistance) # label(axiom). [assumption].
% 1.17/1.49 15 -between(A,B,C) | -between(D,E,C) | between(B,inner_pasch(A,B,C,E,D),D) # label(inner_pasch1) # label(axiom). [assumption].
% 1.17/1.49 16 -between(A,B,C) | -between(D,E,C) | between(E,inner_pasch(A,B,C,E,D),A) # label(inner_pasch2) # label(axiom). [assumption].
% 1.17/1.49 41 extension(A,B,C,C) = B. [resolve(13,a,6,a),flip(a)].
% 1.17/1.49 48 -between(A,B,w) | between(v1,inner_pasch(u1,v1,w,B,A),A). [resolve(15,a,2,a)].
% 1.17/1.49 49 -between(A,B,w) | between(v,inner_pasch(u,v,w,B,A),A). [resolve(15,a,1,a)].
% 1.17/1.49 55 -between(A,B,u1) | between(B,inner_pasch(u,x,u1,B,A),u). [resolve(16,a,3,a)].
% 1.17/1.49 56 -between(A,B,w) | between(B,inner_pasch(u1,v1,w,B,A),u1). [resolve(16,a,2,a)].
% 1.17/1.49 57 -between(A,B,w) | between(B,inner_pasch(u,v,w,B,A),u). [resolve(16,a,1,a)].
% 1.17/1.49 151 between(A,B,B). [para(41(a,1),5(a,3))].
% 1.17/1.49 391 between(v1,inner_pasch(u1,v1,w,w,A),A). [resolve(48,a,151,a)].
% 1.17/1.49 410 inner_pasch(u1,v1,w,w,v1) = v1. [resolve(391,a,12,a),flip(a)].
% 1.17/1.49 436 between(v,inner_pasch(u,v,w,w,A),A). [resolve(49,a,151,a)].
% 1.17/1.49 456 inner_pasch(u,v,w,w,v) = v. [resolve(436,a,12,a),flip(a)].
% 1.17/1.49 698 between(w,inner_pasch(u1,v1,w,w,A),u1). [resolve(56,a,151,a)].
% 1.17/1.49 704 between(w,inner_pasch(u,v,w,w,A),u). [resolve(57,a,151,a)].
% 1.17/1.49 723 between(w,v1,u1). [para(410(a,1),698(a,2))].
% 1.17/1.49 724 between(v1,inner_pasch(u,x,u1,v1,w),u). [resolve(723,a,55,a)].
% 1.17/1.49 772 between(w,v,u). [para(456(a,1),704(a,2))].
% 1.17/1.49 792 $F. [ur(16,b,772,a,c,11,a),unit_del(a,724)].
% 1.17/1.49
% 1.17/1.49 % SZS output end Refutation
% 1.17/1.49 ============================== end of proof ==========================
% 1.17/1.49
% 1.17/1.49 ============================== STATISTICS ============================
% 1.17/1.49
% 1.17/1.49 Given=105. Generated=1157. Kept=791. proofs=1.
% 1.17/1.49 Usable=95. Sos=623. Demods=6. Limbo=14, Disabled=82. Hints=0.
% 1.17/1.49 Megabytes=0.98.
% 1.17/1.49 User_CPU=0.54, System_CPU=0.01, Wall_clock=0.
% 1.17/1.49
% 1.17/1.49 ============================== end of statistics =====================
% 1.17/1.49
% 1.17/1.49 ============================== end of search =========================
% 1.17/1.49
% 1.17/1.49 THEOREM PROVED
% 1.17/1.49 % SZS status Unsatisfiable
% 1.17/1.49
% 1.17/1.49 Exiting with 1 proof.
% 1.17/1.49
% 1.17/1.49 Process 2618 exit (max_proofs) Sat Jun 18 18:17:14 2022
% 1.17/1.49 Prover9 interrupted
%------------------------------------------------------------------------------