TSTP Solution File: GEO064-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO064-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:41 EDT 2022
% Result : Unsatisfiable 1.05s 1.37s
% Output : Refutation 1.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO064-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 00:48:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.05/1.37 ============================== Prover9 ===============================
% 1.05/1.37 Prover9 (32) version 2009-11A, November 2009.
% 1.05/1.37 Process 13754 was started by sandbox on n011.cluster.edu,
% 1.05/1.37 Sat Jun 18 00:48:23 2022
% 1.05/1.37 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13398_n011.cluster.edu".
% 1.05/1.37 ============================== end of head ===========================
% 1.05/1.37
% 1.05/1.37 ============================== INPUT =================================
% 1.05/1.37
% 1.05/1.37 % Reading from file /tmp/Prover9_13398_n011.cluster.edu
% 1.05/1.37
% 1.05/1.37 set(prolog_style_variables).
% 1.05/1.37 set(auto2).
% 1.05/1.37 % set(auto2) -> set(auto).
% 1.05/1.37 % set(auto) -> set(auto_inference).
% 1.05/1.37 % set(auto) -> set(auto_setup).
% 1.05/1.37 % set(auto_setup) -> set(predicate_elim).
% 1.05/1.37 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.05/1.37 % set(auto) -> set(auto_limits).
% 1.05/1.37 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.05/1.37 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.05/1.37 % set(auto) -> set(auto_denials).
% 1.05/1.37 % set(auto) -> set(auto_process).
% 1.05/1.37 % set(auto2) -> assign(new_constants, 1).
% 1.05/1.37 % set(auto2) -> assign(fold_denial_max, 3).
% 1.05/1.37 % set(auto2) -> assign(max_weight, "200.000").
% 1.05/1.37 % set(auto2) -> assign(max_hours, 1).
% 1.05/1.37 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.05/1.37 % set(auto2) -> assign(max_seconds, 0).
% 1.05/1.37 % set(auto2) -> assign(max_minutes, 5).
% 1.05/1.37 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.05/1.37 % set(auto2) -> set(sort_initial_sos).
% 1.05/1.37 % set(auto2) -> assign(sos_limit, -1).
% 1.05/1.37 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.05/1.37 % set(auto2) -> assign(max_megs, 400).
% 1.05/1.37 % set(auto2) -> assign(stats, some).
% 1.05/1.37 % set(auto2) -> clear(echo_input).
% 1.05/1.37 % set(auto2) -> set(quiet).
% 1.05/1.37 % set(auto2) -> clear(print_initial_clauses).
% 1.05/1.37 % set(auto2) -> clear(print_given).
% 1.05/1.37 assign(lrs_ticks,-1).
% 1.05/1.37 assign(sos_limit,10000).
% 1.05/1.37 assign(order,kbo).
% 1.05/1.37 set(lex_order_vars).
% 1.05/1.37 clear(print_given).
% 1.05/1.37
% 1.05/1.37 % formulas(sos). % not echoed (24 formulas)
% 1.05/1.37
% 1.05/1.37 ============================== end of input ==========================
% 1.05/1.37
% 1.05/1.37 % From the command line: assign(max_seconds, 300).
% 1.05/1.37
% 1.05/1.37 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.05/1.37
% 1.05/1.37 % Formulas that are not ordinary clauses:
% 1.05/1.37
% 1.05/1.37 ============================== end of process non-clausal formulas ===
% 1.05/1.37
% 1.05/1.37 ============================== PROCESS INITIAL CLAUSES ===============
% 1.05/1.37
% 1.05/1.37 ============================== PREDICATE ELIMINATION =================
% 1.05/1.37
% 1.05/1.37 ============================== end predicate elimination =============
% 1.05/1.37
% 1.05/1.37 Auto_denials: (non-Horn, no changes).
% 1.05/1.37
% 1.05/1.37 Term ordering decisions:
% 1.05/1.37 Function symbol KB weights: u=1. v=1. w=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.05/1.37
% 1.05/1.37 ============================== end of process initial clauses ========
% 1.05/1.37
% 1.05/1.37 ============================== CLAUSES FOR SEARCH ====================
% 1.05/1.37
% 1.05/1.37 ============================== end of clauses for search =============
% 1.05/1.37
% 1.05/1.37 ============================== SEARCH ================================
% 1.05/1.37
% 1.05/1.37 % Starting search at 0.01 seconds.
% 1.05/1.37
% 1.05/1.37 ============================== PROOF =================================
% 1.05/1.37 % SZS status Unsatisfiable
% 1.05/1.37 % SZS output start Refutation
% 1.05/1.37
% 1.05/1.37 % Proof 1 at 0.34 (+ 0.00) seconds.
% 1.05/1.37 % Length of proof is 18.
% 1.05/1.37 % Level of proof is 5.
% 1.05/1.37 % Maximum clause weight is 17.000.
% 1.05/1.37 % Given clauses 110.
% 1.05/1.37
% 1.05/1.37 1 between(w,v,u) # label(v_between_w_and_u) # label(hypothesis). [assumption].
% 1.05/1.37 3 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom). [assumption].
% 1.05/1.37 4 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom). [assumption].
% 1.05/1.37 8 -colinear(u,v,w) # label(prove_uvw_colinear) # label(negated_conjecture). [assumption].
% 1.05/1.37 9 -between(A,B,A) | A = B # label(identity_for_betweeness) # label(axiom). [assumption].
% 1.05/1.37 10 -equidistant(A,B,C,C) | A = B # label(identity_for_equidistance) # label(axiom). [assumption].
% 1.05/1.37 11 -between(A,B,C) | colinear(A,B,C) # label(colinearity1) # label(axiom). [assumption].
% 1.05/1.37 16 -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.05/1.37 17 -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.05/1.37 43 extension(A,B,C,C) = B. [resolve(10,a,4,a),flip(a)].
% 1.05/1.37 46 -between(u,v,w). [ur(11,b,8,a)].
% 1.05/1.37 61 -between(A,B,u) | between(v,inner_pasch(w,v,u,B,A),A). [resolve(16,a,1,a)].
% 1.05/1.37 65 -between(A,B,u) | between(B,inner_pasch(w,v,u,B,A),w). [resolve(17,a,1,a)].
% 1.05/1.37 137 between(A,B,B). [para(43(a,1),3(a,3))].
% 1.05/1.37 341 between(v,inner_pasch(w,v,u,u,A),A). [resolve(61,a,137,a)].
% 1.05/1.37 361 inner_pasch(w,v,u,u,v) = v. [resolve(341,a,9,a),flip(a)].
% 1.05/1.37 435 between(u,inner_pasch(w,v,u,u,A),w). [resolve(65,a,137,a)].
% 1.05/1.37 453 $F. [para(361(a,1),435(a,2)),unit_del(a,46)].
% 1.05/1.37
% 1.05/1.37 % SZS output end Refutation
% 1.05/1.37 ============================== end of proof ==========================
% 1.05/1.37
% 1.05/1.37 ============================== STATISTICS ============================
% 1.05/1.37
% 1.05/1.37 Given=110. Generated=846. Kept=452. proofs=1.
% 1.05/1.37 Usable=99. Sos=277. Demods=4. Limbo=17, Disabled=83. Hints=0.
% 1.05/1.37 Megabytes=0.50.
% 1.05/1.37 User_CPU=0.34, System_CPU=0.00, Wall_clock=0.
% 1.05/1.37
% 1.05/1.37 ============================== end of statistics =====================
% 1.05/1.37
% 1.05/1.37 ============================== end of search =========================
% 1.05/1.37
% 1.05/1.37 THEOREM PROVED
% 1.05/1.37 % SZS status Unsatisfiable
% 1.05/1.37
% 1.05/1.37 Exiting with 1 proof.
% 1.05/1.37
% 1.05/1.37 Process 13754 exit (max_proofs) Sat Jun 18 00:48:23 2022
% 1.05/1.37 Prover9 interrupted
%------------------------------------------------------------------------------