TSTP Solution File: GEO062-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO062-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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:40 EDT 2022
% Result : Unsatisfiable 2.09s 2.38s
% Output : Refutation 2.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO062-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n012.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 : Fri Jun 17 23:16:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.09/2.38 ============================== Prover9 ===============================
% 2.09/2.38 Prover9 (32) version 2009-11A, November 2009.
% 2.09/2.38 Process 9132 was started by sandbox on n012.cluster.edu,
% 2.09/2.38 Fri Jun 17 23:16:24 2022
% 2.09/2.38 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8978_n012.cluster.edu".
% 2.09/2.38 ============================== end of head ===========================
% 2.09/2.38
% 2.09/2.38 ============================== INPUT =================================
% 2.09/2.38
% 2.09/2.38 % Reading from file /tmp/Prover9_8978_n012.cluster.edu
% 2.09/2.38
% 2.09/2.38 set(prolog_style_variables).
% 2.09/2.38 set(auto2).
% 2.09/2.38 % set(auto2) -> set(auto).
% 2.09/2.38 % set(auto) -> set(auto_inference).
% 2.09/2.38 % set(auto) -> set(auto_setup).
% 2.09/2.38 % set(auto_setup) -> set(predicate_elim).
% 2.09/2.38 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.09/2.38 % set(auto) -> set(auto_limits).
% 2.09/2.38 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.09/2.38 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.09/2.38 % set(auto) -> set(auto_denials).
% 2.09/2.38 % set(auto) -> set(auto_process).
% 2.09/2.38 % set(auto2) -> assign(new_constants, 1).
% 2.09/2.38 % set(auto2) -> assign(fold_denial_max, 3).
% 2.09/2.38 % set(auto2) -> assign(max_weight, "200.000").
% 2.09/2.38 % set(auto2) -> assign(max_hours, 1).
% 2.09/2.38 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.09/2.38 % set(auto2) -> assign(max_seconds, 0).
% 2.09/2.38 % set(auto2) -> assign(max_minutes, 5).
% 2.09/2.38 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.09/2.38 % set(auto2) -> set(sort_initial_sos).
% 2.09/2.38 % set(auto2) -> assign(sos_limit, -1).
% 2.09/2.38 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.09/2.38 % set(auto2) -> assign(max_megs, 400).
% 2.09/2.38 % set(auto2) -> assign(stats, some).
% 2.09/2.38 % set(auto2) -> clear(echo_input).
% 2.09/2.38 % set(auto2) -> set(quiet).
% 2.09/2.38 % set(auto2) -> clear(print_initial_clauses).
% 2.09/2.38 % set(auto2) -> clear(print_given).
% 2.09/2.38 assign(lrs_ticks,-1).
% 2.09/2.38 assign(sos_limit,10000).
% 2.09/2.38 assign(order,kbo).
% 2.09/2.38 set(lex_order_vars).
% 2.09/2.38 clear(print_given).
% 2.09/2.38
% 2.09/2.38 % formulas(sos). % not echoed (75 formulas)
% 2.09/2.38
% 2.09/2.38 ============================== end of input ==========================
% 2.09/2.38
% 2.09/2.38 % From the command line: assign(max_seconds, 300).
% 2.09/2.38
% 2.09/2.38 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.09/2.38
% 2.09/2.38 % Formulas that are not ordinary clauses:
% 2.09/2.38
% 2.09/2.38 ============================== end of process non-clausal formulas ===
% 2.09/2.38
% 2.09/2.38 ============================== PROCESS INITIAL CLAUSES ===============
% 2.09/2.38
% 2.09/2.38 ============================== PREDICATE ELIMINATION =================
% 2.09/2.38
% 2.09/2.38 ============================== end predicate elimination =============
% 2.09/2.38
% 2.09/2.38 Auto_denials: (non-Horn, no changes).
% 2.09/2.38
% 2.09/2.38 Term ordering decisions:
% 2.09/2.38 Function symbol KB weights: lower_dimension_point_1=1. lower_dimension_point_2=1. u=1. v=1. w=1. lower_dimension_point_3=1. reflection=1. extension=1. insertion=1. inner_pasch=1. euclid1=1. euclid2=1. continuous=1.
% 2.09/2.38
% 2.09/2.38 ============================== end of process initial clauses ========
% 2.09/2.38
% 2.09/2.38 ============================== CLAUSES FOR SEARCH ====================
% 2.09/2.38
% 2.09/2.38 ============================== end of clauses for search =============
% 2.09/2.38
% 2.09/2.38 ============================== SEARCH ================================
% 2.09/2.38
% 2.09/2.38 % Starting search at 0.02 seconds.
% 2.09/2.38
% 2.09/2.38 ============================== PROOF =================================
% 2.09/2.38 % SZS status Unsatisfiable
% 2.09/2.38 % SZS output start Refutation
% 2.09/2.38
% 2.09/2.38 % Proof 1 at 1.38 (+ 0.00) seconds.
% 2.09/2.38 % Length of proof is 17.
% 2.09/2.38 % Level of proof is 5.
% 2.09/2.38 % Maximum clause weight is 15.000.
% 2.09/2.38 % Given clauses 157.
% 2.09/2.38
% 2.09/2.38 3 between(u,v,w) # label(v_between_u_and_w) # label(hypothesis). [assumption].
% 2.09/2.38 15 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom). [assumption].
% 2.09/2.38 24 insertion(A,B,C,D) = extension(extension(B,A,lower_dimension_point_1,lower_dimension_point_2),A,C,D) # label(insertion) # label(axiom). [assumption].
% 2.09/2.38 34 A != extension(B,A,lower_dimension_point_1,lower_dimension_point_2) # label(e3_1) # label(axiom). [assumption].
% 2.09/2.38 35 extension(A,B,lower_dimension_point_1,lower_dimension_point_2) != B. [copy(34),flip(a)].
% 2.09/2.38 36 v != insertion(u,w,u,v) # label(prove_v_equals_insertion) # label(negated_conjecture). [assumption].
% 2.09/2.38 37 extension(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u,u,v) != v. [copy(36),rewrite([24(6)]),flip(a)].
% 2.09/2.38 44 -between(A,B,C) | between(C,B,A) # label(t1) # label(axiom). [assumption].
% 2.09/2.38 57 -between(A,B,C) | -between(A,C,D) | between(B,C,D) # label(b5) # label(axiom). [assumption].
% 2.09/2.38 60 -between(A,B,C) | A = B | C = extension(A,B,B,C) # label(d10_1) # label(axiom). [assumption].
% 2.09/2.38 61 -between(A,B,C) | A = B | extension(A,B,B,C) = C. [copy(60),flip(c)].
% 2.09/2.38 155 between(w,v,u). [resolve(44,a,3,a)].
% 2.09/2.38 212 -between(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u,v). [ur(61,b,35,a,c,37,a)].
% 2.09/2.38 575 -between(w,u,A) | between(v,u,A). [resolve(155,a,57,a)].
% 2.09/2.38 977 between(v,u,extension(w,u,A,B)). [resolve(575,a,15,a)].
% 2.09/2.38 1270 between(extension(w,u,A,B),u,v). [resolve(977,a,44,a)].
% 2.09/2.38 1271 $F. [resolve(1270,a,212,a)].
% 2.09/2.38
% 2.09/2.38 % SZS output end Refutation
% 2.09/2.38 ============================== end of proof ==========================
% 2.09/2.38
% 2.09/2.38 ============================== STATISTICS ============================
% 2.09/2.38
% 2.09/2.38 Given=157. Generated=3897. Kept=1254. proofs=1.
% 2.09/2.38 Usable=156. Sos=1008. Demods=11. Limbo=35, Disabled=129. Hints=0.
% 2.09/2.38 Megabytes=1.35.
% 2.09/2.38 User_CPU=1.38, System_CPU=0.00, Wall_clock=1.
% 2.09/2.38
% 2.09/2.38 ============================== end of statistics =====================
% 2.09/2.38
% 2.09/2.38 ============================== end of search =========================
% 2.09/2.38
% 2.09/2.38 THEOREM PROVED
% 2.09/2.38 % SZS status Unsatisfiable
% 2.09/2.38
% 2.09/2.38 Exiting with 1 proof.
% 2.09/2.38
% 2.09/2.38 Process 9132 exit (max_proofs) Fri Jun 17 23:16:25 2022
% 2.09/2.38 Prover9 interrupted
%------------------------------------------------------------------------------