TSTP Solution File: GEO037-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO037-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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:26 EDT 2022
% Result : Unsatisfiable 5.06s 5.37s
% Output : Refutation 5.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO037-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n009.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 20:50:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 5.06/5.37 ============================== Prover9 ===============================
% 5.06/5.37 Prover9 (32) version 2009-11A, November 2009.
% 5.06/5.37 Process 22817 was started by sandbox on n009.cluster.edu,
% 5.06/5.37 Fri Jun 17 20:50:53 2022
% 5.06/5.37 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22664_n009.cluster.edu".
% 5.06/5.37 ============================== end of head ===========================
% 5.06/5.37
% 5.06/5.37 ============================== INPUT =================================
% 5.06/5.37
% 5.06/5.37 % Reading from file /tmp/Prover9_22664_n009.cluster.edu
% 5.06/5.37
% 5.06/5.37 set(prolog_style_variables).
% 5.06/5.37 set(auto2).
% 5.06/5.37 % set(auto2) -> set(auto).
% 5.06/5.37 % set(auto) -> set(auto_inference).
% 5.06/5.37 % set(auto) -> set(auto_setup).
% 5.06/5.37 % set(auto_setup) -> set(predicate_elim).
% 5.06/5.37 % set(auto_setup) -> assign(eq_defs, unfold).
% 5.06/5.37 % set(auto) -> set(auto_limits).
% 5.06/5.37 % set(auto_limits) -> assign(max_weight, "100.000").
% 5.06/5.37 % set(auto_limits) -> assign(sos_limit, 20000).
% 5.06/5.37 % set(auto) -> set(auto_denials).
% 5.06/5.37 % set(auto) -> set(auto_process).
% 5.06/5.37 % set(auto2) -> assign(new_constants, 1).
% 5.06/5.37 % set(auto2) -> assign(fold_denial_max, 3).
% 5.06/5.37 % set(auto2) -> assign(max_weight, "200.000").
% 5.06/5.37 % set(auto2) -> assign(max_hours, 1).
% 5.06/5.37 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 5.06/5.37 % set(auto2) -> assign(max_seconds, 0).
% 5.06/5.37 % set(auto2) -> assign(max_minutes, 5).
% 5.06/5.37 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 5.06/5.37 % set(auto2) -> set(sort_initial_sos).
% 5.06/5.37 % set(auto2) -> assign(sos_limit, -1).
% 5.06/5.37 % set(auto2) -> assign(lrs_ticks, 3000).
% 5.06/5.37 % set(auto2) -> assign(max_megs, 400).
% 5.06/5.37 % set(auto2) -> assign(stats, some).
% 5.06/5.37 % set(auto2) -> clear(echo_input).
% 5.06/5.37 % set(auto2) -> set(quiet).
% 5.06/5.37 % set(auto2) -> clear(print_initial_clauses).
% 5.06/5.37 % set(auto2) -> clear(print_given).
% 5.06/5.37 assign(lrs_ticks,-1).
% 5.06/5.37 assign(sos_limit,10000).
% 5.06/5.37 assign(order,kbo).
% 5.06/5.37 set(lex_order_vars).
% 5.06/5.37 clear(print_given).
% 5.06/5.37
% 5.06/5.37 % formulas(sos). % not echoed (19 formulas)
% 5.06/5.37
% 5.06/5.37 ============================== end of input ==========================
% 5.06/5.37
% 5.06/5.37 % From the command line: assign(max_seconds, 300).
% 5.06/5.37
% 5.06/5.37 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 5.06/5.37
% 5.06/5.37 % Formulas that are not ordinary clauses:
% 5.06/5.37
% 5.06/5.37 ============================== end of process non-clausal formulas ===
% 5.06/5.37
% 5.06/5.37 ============================== PROCESS INITIAL CLAUSES ===============
% 5.06/5.37
% 5.06/5.37 ============================== PREDICATE ELIMINATION =================
% 5.06/5.37
% 5.06/5.37 ============================== end predicate elimination =============
% 5.06/5.37
% 5.06/5.37 Auto_denials: (non-Horn, no changes).
% 5.06/5.37
% 5.06/5.37 Term ordering decisions:
% 5.06/5.37 Function symbol KB weights: v=1. lower_dimension_point_1=1. lower_dimension_point_2=1. u=1. x=1. w=1. lower_dimension_point_3=1. extension=1. euclid1=1. euclid2=1. inner_pasch=1. continuous=1.
% 5.06/5.37
% 5.06/5.37 ============================== end of process initial clauses ========
% 5.06/5.37
% 5.06/5.37 ============================== CLAUSES FOR SEARCH ====================
% 5.06/5.37
% 5.06/5.37 ============================== end of clauses for search =============
% 5.06/5.37
% 5.06/5.37 ============================== SEARCH ================================
% 5.06/5.37
% 5.06/5.37 % Starting search at 0.01 seconds.
% 5.06/5.37
% 5.06/5.37 ============================== PROOF =================================
% 5.06/5.37 % SZS status Unsatisfiable
% 5.06/5.37 % SZS output start Refutation
% 5.06/5.37
% 5.06/5.37 % Proof 1 at 4.40 (+ 0.00) seconds.
% 5.06/5.37 % Length of proof is 20.
% 5.06/5.37 % Level of proof is 9.
% 5.06/5.37 % Maximum clause weight is 20.000.
% 5.06/5.37 % Given clauses 127.
% 5.06/5.37
% 5.06/5.37 2 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom). [assumption].
% 5.06/5.37 3 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom). [assumption].
% 5.06/5.37 6 -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2) # label(lower_dimension3) # label(axiom). [assumption].
% 5.06/5.37 8 -equidistant(A,B,C,C) | A = B # label(identity_for_equidistance) # label(axiom). [assumption].
% 5.06/5.37 9 -equidistant(A,B,C,D) | -equidistant(A,B,E,F) | equidistant(C,D,E,F) # label(transitivity_for_equidistance) # label(axiom). [assumption].
% 5.06/5.37 16 v = extension(u,v,lower_dimension_point_1,lower_dimension_point_2) | -equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2)) | -between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)) # label(prove_lengthen) # label(negated_conjecture). [assumption].
% 5.06/5.37 17 extension(u,v,lower_dimension_point_1,lower_dimension_point_2) = v | -equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2)). [copy(16),flip(a),unit_del(c,2)].
% 5.06/5.37 21 -equidistant(A,B,C,D) | equidistant(C,D,C,D). [factor(9,a,b)].
% 5.06/5.37 38 extension(A,B,C,C) = B. [resolve(8,a,3,a),flip(a)].
% 5.06/5.37 39 -equidistant(A,extension(B,A,C,D),E,F) | equidistant(C,D,E,F). [resolve(9,a,3,a)].
% 5.06/5.37 87 equidistant(A,B,A,B). [resolve(21,a,3,a)].
% 5.06/5.37 106 between(A,B,B). [para(38(a,1),2(a,3))].
% 5.06/5.37 167 equidistant(A,B,C,extension(D,C,A,B)). [resolve(39,a,87,a)].
% 5.06/5.37 169 equidistant(A,B,C,extension(D,C,E,extension(F,E,A,B))). [resolve(167,a,39,a)].
% 5.06/5.37 181 -equidistant(A,B,C,D) | equidistant(C,D,E,extension(F,E,A,B)). [resolve(167,a,9,b)].
% 5.06/5.37 1080 equidistant(A,extension(B,A,C,D),E,extension(F,E,C,D)). [resolve(181,a,167,a)].
% 5.06/5.37 1081 extension(u,v,lower_dimension_point_1,lower_dimension_point_2) = v. [back_unit_del(17),unit_del(b,1080)].
% 5.06/5.37 1119 equidistant(lower_dimension_point_1,lower_dimension_point_2,A,A). [para(1081(a,1),169(a,4,4)),rewrite([38(5)])].
% 5.06/5.37 1139 lower_dimension_point_2 = lower_dimension_point_1. [resolve(1119,a,8,a),flip(a)].
% 5.06/5.37 1143 $F. [back_rewrite(6),rewrite([1139(3)]),unit_del(a,106)].
% 5.06/5.37
% 5.06/5.37 % SZS output end Refutation
% 5.06/5.37 ============================== end of proof ==========================
% 5.06/5.37
% 5.06/5.37 ============================== STATISTICS ============================
% 5.06/5.37
% 5.06/5.37 Given=127. Generated=2034. Kept=1141. proofs=1.
% 5.06/5.37 Usable=105. Sos=855. Demods=12. Limbo=4, Disabled=196. Hints=0.
% 5.06/5.37 Megabytes=1.09.
% 5.06/5.37 User_CPU=4.40, System_CPU=0.00, Wall_clock=4.
% 5.06/5.37
% 5.06/5.37 ============================== end of statistics =====================
% 5.06/5.37
% 5.06/5.37 ============================== end of search =========================
% 5.06/5.37
% 5.06/5.37 THEOREM PROVED
% 5.06/5.37 % SZS status Unsatisfiable
% 5.06/5.37
% 5.06/5.37 Exiting with 1 proof.
% 5.06/5.37
% 5.06/5.37 Process 22817 exit (max_proofs) Fri Jun 17 20:50:57 2022
% 5.06/5.37 Prover9 interrupted
%------------------------------------------------------------------------------