TSTP Solution File: GEO044-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO044-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:31 EDT 2022
% Result : Unsatisfiable 3.27s 3.53s
% Output : Refutation 3.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO044-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 00:15:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 3.27/3.53 ============================== Prover9 ===============================
% 3.27/3.53 Prover9 (32) version 2009-11A, November 2009.
% 3.27/3.53 Process 11326 was started by sandbox on n016.cluster.edu,
% 3.27/3.53 Sat Jun 18 00:15:37 2022
% 3.27/3.53 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11173_n016.cluster.edu".
% 3.27/3.53 ============================== end of head ===========================
% 3.27/3.53
% 3.27/3.53 ============================== INPUT =================================
% 3.27/3.53
% 3.27/3.53 % Reading from file /tmp/Prover9_11173_n016.cluster.edu
% 3.27/3.53
% 3.27/3.53 set(prolog_style_variables).
% 3.27/3.53 set(auto2).
% 3.27/3.53 % set(auto2) -> set(auto).
% 3.27/3.53 % set(auto) -> set(auto_inference).
% 3.27/3.53 % set(auto) -> set(auto_setup).
% 3.27/3.53 % set(auto_setup) -> set(predicate_elim).
% 3.27/3.53 % set(auto_setup) -> assign(eq_defs, unfold).
% 3.27/3.53 % set(auto) -> set(auto_limits).
% 3.27/3.53 % set(auto_limits) -> assign(max_weight, "100.000").
% 3.27/3.53 % set(auto_limits) -> assign(sos_limit, 20000).
% 3.27/3.53 % set(auto) -> set(auto_denials).
% 3.27/3.53 % set(auto) -> set(auto_process).
% 3.27/3.53 % set(auto2) -> assign(new_constants, 1).
% 3.27/3.53 % set(auto2) -> assign(fold_denial_max, 3).
% 3.27/3.53 % set(auto2) -> assign(max_weight, "200.000").
% 3.27/3.53 % set(auto2) -> assign(max_hours, 1).
% 3.27/3.53 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 3.27/3.53 % set(auto2) -> assign(max_seconds, 0).
% 3.27/3.53 % set(auto2) -> assign(max_minutes, 5).
% 3.27/3.53 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 3.27/3.53 % set(auto2) -> set(sort_initial_sos).
% 3.27/3.53 % set(auto2) -> assign(sos_limit, -1).
% 3.27/3.53 % set(auto2) -> assign(lrs_ticks, 3000).
% 3.27/3.53 % set(auto2) -> assign(max_megs, 400).
% 3.27/3.53 % set(auto2) -> assign(stats, some).
% 3.27/3.53 % set(auto2) -> clear(echo_input).
% 3.27/3.53 % set(auto2) -> set(quiet).
% 3.27/3.53 % set(auto2) -> clear(print_initial_clauses).
% 3.27/3.53 % set(auto2) -> clear(print_given).
% 3.27/3.53 assign(lrs_ticks,-1).
% 3.27/3.53 assign(sos_limit,10000).
% 3.27/3.53 assign(order,kbo).
% 3.27/3.53 set(lex_order_vars).
% 3.27/3.53 clear(print_given).
% 3.27/3.53
% 3.27/3.53 % formulas(sos). % not echoed (57 formulas)
% 3.27/3.53
% 3.27/3.53 ============================== end of input ==========================
% 3.27/3.53
% 3.27/3.53 % From the command line: assign(max_seconds, 300).
% 3.27/3.53
% 3.27/3.53 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 3.27/3.53
% 3.27/3.53 % Formulas that are not ordinary clauses:
% 3.27/3.53
% 3.27/3.53 ============================== end of process non-clausal formulas ===
% 3.27/3.53
% 3.27/3.53 ============================== PROCESS INITIAL CLAUSES ===============
% 3.27/3.53
% 3.27/3.53 ============================== PREDICATE ELIMINATION =================
% 3.27/3.53
% 3.27/3.53 ============================== end predicate elimination =============
% 3.27/3.53
% 3.27/3.53 Auto_denials: (non-Horn, no changes).
% 3.27/3.53
% 3.27/3.53 Term ordering decisions:
% 3.27/3.53 Function symbol KB weights: v=1. w=1. u=1. x=1. lower_dimension_point_1=1. lower_dimension_point_2=1. lower_dimension_point_3=1. reflection=1. extension=1. euclid1=1. euclid2=1. inner_pasch=1. continuous=1.
% 3.27/3.53
% 3.27/3.53 ============================== end of process initial clauses ========
% 3.27/3.53
% 3.27/3.53 ============================== CLAUSES FOR SEARCH ====================
% 3.27/3.53
% 3.27/3.53 ============================== end of clauses for search =============
% 3.27/3.53
% 3.27/3.53 ============================== SEARCH ================================
% 3.27/3.53
% 3.27/3.53 % Starting search at 0.02 seconds.
% 3.27/3.53
% 3.27/3.53 ============================== PROOF =================================
% 3.27/3.53 % SZS status Unsatisfiable
% 3.27/3.53 % SZS output start Refutation
% 3.27/3.53
% 3.27/3.53 % Proof 1 at 2.51 (+ 0.00) seconds.
% 3.27/3.53 % Length of proof is 17.
% 3.27/3.53 % Level of proof is 3.
% 3.27/3.53 % Maximum clause weight is 19.000.
% 3.27/3.53 % Given clauses 151.
% 3.27/3.53
% 3.27/3.53 3 between(u,v,w) # label(v_between_u_and_w) # label(hypothesis). [assumption].
% 3.27/3.53 4 between(v,w,x) # label(w_between_v_and_x) # label(hypothesis). [assumption].
% 3.27/3.53 16 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom). [assumption].
% 3.27/3.53 17 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom). [assumption].
% 3.27/3.53 23 v != w # label(v_not_w) # label(hypothesis). [assumption].
% 3.27/3.53 24 w != v. [copy(23),flip(a)].
% 3.27/3.53 28 -between(u,w,x) # label(prove_w_between_u_and_x) # label(negated_conjecture). [assumption].
% 3.27/3.53 38 -equidistant(A,B,C,D) | equidistant(A,B,D,C) # label(d4_1) # label(axiom). [assumption].
% 3.27/3.53 43 A != extension(B,C,D,E) | between(B,C,A) # label(b0) # label(axiom). [assumption].
% 3.27/3.53 44 extension(A,B,C,D) != E | between(A,B,E). [copy(43),flip(a)].
% 3.27/3.53 48 -between(A,B,C) | -between(A,C,D) | between(B,C,D) # label(b5) # label(axiom). [assumption].
% 3.27/3.53 55 -between(A,B,C) | -between(A,B,D) | -equidistant(B,C,B,D) | A = B | C = D # label(d9) # label(axiom). [assumption].
% 3.27/3.53 96 equidistant(A,extension(B,A,C,D),D,C). [resolve(38,a,17,a)].
% 3.27/3.53 101 extension(u,w,A,B) != x. [ur(44,b,28,a)].
% 3.27/3.53 130 -between(u,w,A) | between(v,w,A). [resolve(48,a,3,a)].
% 3.27/3.53 442 between(v,w,extension(u,w,A,B)). [resolve(130,a,16,a)].
% 3.27/3.53 855 $F. [ur(55,b,4,a,c,96,a,d,24,a(flip),e,101,a),unit_del(a,442)].
% 3.27/3.53
% 3.27/3.53 % SZS output end Refutation
% 3.27/3.53 ============================== end of proof ==========================
% 3.27/3.53
% 3.27/3.53 ============================== STATISTICS ============================
% 3.27/3.53
% 3.27/3.53 Given=151. Generated=2463. Kept=844. proofs=1.
% 3.27/3.53 Usable=148. Sos=661. Demods=12. Limbo=2, Disabled=90. Hints=0.
% 3.27/3.53 Megabytes=0.81.
% 3.27/3.53 User_CPU=2.51, System_CPU=0.00, Wall_clock=2.
% 3.27/3.53
% 3.27/3.53 ============================== end of statistics =====================
% 3.27/3.53
% 3.27/3.53 ============================== end of search =========================
% 3.27/3.53
% 3.27/3.53 THEOREM PROVED
% 3.27/3.53 % SZS status Unsatisfiable
% 3.27/3.53
% 3.27/3.53 Exiting with 1 proof.
% 3.27/3.53
% 3.27/3.53 Process 11326 exit (max_proofs) Sat Jun 18 00:15:39 2022
% 3.27/3.53 Prover9 interrupted
%------------------------------------------------------------------------------