TSTP Solution File: GEO170+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO170+3 : TPTP v8.1.0. Released v4.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:54:32 EDT 2022
% Result : Theorem 0.45s 1.04s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO170+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 18 15:42:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.45/1.04 ============================== Prover9 ===============================
% 0.45/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.04 Process 4472 was started by sandbox2 on n011.cluster.edu,
% 0.45/1.04 Sat Jun 18 15:42:23 2022
% 0.45/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4319_n011.cluster.edu".
% 0.45/1.04 ============================== end of head ===========================
% 0.45/1.04
% 0.45/1.04 ============================== INPUT =================================
% 0.45/1.04
% 0.45/1.04 % Reading from file /tmp/Prover9_4319_n011.cluster.edu
% 0.45/1.04
% 0.45/1.04 set(prolog_style_variables).
% 0.45/1.04 set(auto2).
% 0.45/1.04 % set(auto2) -> set(auto).
% 0.45/1.04 % set(auto) -> set(auto_inference).
% 0.45/1.04 % set(auto) -> set(auto_setup).
% 0.45/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.04 % set(auto) -> set(auto_limits).
% 0.45/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.04 % set(auto) -> set(auto_denials).
% 0.45/1.04 % set(auto) -> set(auto_process).
% 0.45/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.04 % set(auto2) -> assign(stats, some).
% 0.45/1.04 % set(auto2) -> clear(echo_input).
% 0.45/1.04 % set(auto2) -> set(quiet).
% 0.45/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.04 % set(auto2) -> clear(print_given).
% 0.45/1.04 assign(lrs_ticks,-1).
% 0.45/1.04 assign(sos_limit,10000).
% 0.45/1.04 assign(order,kbo).
% 0.45/1.04 set(lex_order_vars).
% 0.45/1.04 clear(print_given).
% 0.45/1.04
% 0.45/1.04 % formulas(sos). % not echoed (36 formulas)
% 0.45/1.04
% 0.45/1.04 ============================== end of input ==========================
% 0.45/1.04
% 0.45/1.04 % From the command line: assign(max_seconds, 300).
% 0.45/1.04
% 0.45/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.04
% 0.45/1.04 % Formulas that are not ordinary clauses:
% 0.45/1.04 1 (all X -distinct_points(X,X)) # label(apart1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 2 (all X -distinct_lines(X,X)) # label(apart2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 3 (all X -convergent_lines(X,X)) # label(apart3) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 4 (all X all Y all Z (distinct_points(X,Y) -> distinct_points(X,Z) | distinct_points(Y,Z))) # label(apart4) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 5 (all X all Y all Z (distinct_lines(X,Y) -> distinct_lines(X,Z) | distinct_lines(Y,Z))) # label(apart5) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 6 (all X all Y all Z (convergent_lines(X,Y) -> convergent_lines(X,Z) | convergent_lines(Y,Z))) # label(ax6) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 7 (all X all Y (distinct_points(X,Y) -> -apart_point_and_line(X,line_connecting(X,Y)))) # label(ci1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 8 (all X all Y (distinct_points(X,Y) -> -apart_point_and_line(Y,line_connecting(X,Y)))) # label(ci2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 9 (all X all Y (convergent_lines(X,Y) -> -apart_point_and_line(intersection_point(X,Y),X))) # label(ci3) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 10 (all X all Y (convergent_lines(X,Y) -> -apart_point_and_line(intersection_point(X,Y),Y))) # label(ci4) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 11 (all X all Y all U all V (distinct_points(X,Y) & distinct_lines(U,V) -> apart_point_and_line(X,U) | apart_point_and_line(X,V) | apart_point_and_line(Y,U) | apart_point_and_line(Y,V))) # label(cu1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 12 (all X all Y all Z (apart_point_and_line(X,Y) -> distinct_points(X,Z) | apart_point_and_line(Z,Y))) # label(ceq1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 13 (all X all Y all Z (apart_point_and_line(X,Y) -> distinct_lines(Y,Z) | apart_point_and_line(X,Z))) # label(ceq2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 14 (all X all Y all Z (convergent_lines(X,Y) -> distinct_lines(Y,Z) | convergent_lines(X,Z))) # label(ceq3) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 15 (all X all Y (distinct_lines(X,Y) -> convergent_lines(X,Y))) # label(p1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 16 (all X all Y -convergent_lines(parallel_through_point(Y,X),Y)) # label(cp1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 17 (all X all Y -apart_point_and_line(X,parallel_through_point(Y,X))) # label(cp2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 18 (all X all Y all Z (distinct_lines(Y,Z) -> apart_point_and_line(X,Y) | apart_point_and_line(X,Z) | convergent_lines(Y,Z))) # label(cup1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 19 (all L all M (convergent_lines(L,M) | unorthogonal_lines(L,M))) # label(occu1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 20 (all L all M all N (convergent_lines(L,M) & unorthogonal_lines(L,M) -> convergent_lines(L,N) & unorthogonal_lines(L,N) | convergent_lines(M,N) & unorthogonal_lines(M,N))) # label(oac1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 21 (all A all L -unorthogonal_lines(orthogonal_through_point(L,A),L)) # label(ooc1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 22 (all A all L -apart_point_and_line(A,orthogonal_through_point(L,A))) # label(ooc2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 23 (all A all L all M all N (distinct_lines(L,M) -> apart_point_and_line(A,L) | apart_point_and_line(A,M) | unorthogonal_lines(L,N) | unorthogonal_lines(M,N))) # label(ouo1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 24 (all L all M -(-convergent_lines(L,M) & -unorthogonal_lines(L,M))) # label(coipo1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 25 (all L all M all N ((-convergent_lines(L,M) | -unorthogonal_lines(L,M)) & (-convergent_lines(L,N) | -unorthogonal_lines(L,N)) -> -convergent_lines(M,N) | -unorthogonal_lines(M,N))) # label(cotno1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 26 (all L all M all N (-unorthogonal_lines(L,M) & -unorthogonal_lines(L,N) -> -convergent_lines(M,N))) # label(couo1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 27 (all A all B (point(A) & point(B) & distinct_points(A,B) -> line(line_connecting(A,B)))) # label(con1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 28 (all L all M (line(L) & line(M) & convergent_lines(L,M) -> point(intersection_point(L,M)))) # label(int1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 29 (all L all A (line(L) & point(A) -> line(parallel_through_point(L,A)))) # label(par1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 30 (all L all A (line(L) & point(A) -> line(orthogonal_through_point(L,A)))) # label(orth1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 31 (all X all Y (equal_points(X,Y) <-> -distinct_points(X,Y))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 32 (all X all Y (equal_lines(X,Y) <-> -distinct_lines(X,Y))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 33 (all X all Y (parallel_lines(X,Y) <-> -convergent_lines(X,Y))) # label(a3) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 34 (all X all Y (incident_point_and_line(X,Y) <-> -apart_point_and_line(X,Y))) # label(a4) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 35 (all X all Y (orthogonal_lines(X,Y) <-> -unorthogonal_lines(X,Y))) # label(a5) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 36 -(all X all Y all Z (distinct_points(X,Y) & incident_point_and_line(X,Z) & incident_point_and_line(Y,Z) -> equal_lines(Z,line_connecting(X,Y)))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.04
% 0.45/1.04 ============================== end of process non-clausal formulas ===
% 0.45/1.04
% 0.45/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.04
% 0.45/1.04 ============================== PREDICATE ELIMINATION =================
% 0.45/1.04 37 -incident_point_and_line(A,B) | -apart_point_and_line(A,B) # label(a4) # label(axiom). [clausify(34)].
% 0.45/1.04 38 incident_point_and_line(c1,c3) # label(con) # label(negated_conjecture). [clausify(36)].
% 0.45/1.04 39 incident_point_and_line(c2,c3) # label(con) # label(negated_conjecture). [clausify(36)].
% 0.45/1.04 40 incident_point_and_line(A,B) | apart_point_and_line(A,B) # label(a4) # label(axiom). [clausify(34)].
% 0.45/1.04 Derived: -apart_point_and_line(c1,c3). [resolve(37,a,38,a)].
% 0.45/1.04 Derived: -apart_point_and_line(c2,c3). [resolve(37,a,39,a)].
% 0.45/1.04 41 -equal_points(A,B) | -distinct_points(A,B) # label(ax1) # label(axiom). [clausify(31)].
% 0.45/1.04 42 equal_points(A,B) | distinct_points(A,B) # label(ax1) # label(axiom). [clausify(31)].
% 0.45/1.04 43 -equal_lines(c3,line_connecting(c1,c2)) # label(con) # label(negated_conjecture). [clausify(36)].
% 0.45/1.04 44 equal_lines(A,B) | distinct_lines(A,B) # label(ax2) # label(axiom). [clausify(32)].
% 0.45/1.04 Derived: distinct_lines(c3,line_connecting(c1,c2)). [resolve(43,a,44,a)].
% 0.45/1.04 45 -equal_lines(A,B) | -distinct_lines(A,B) # label(ax2) # label(axiom). [clausify(32)].
% 0.45/1.04 46 -parallel_lines(A,B) | -convergent_lines(A,B) # label(a3) # label(axiom). [clausify(33)].
% 0.45/1.04 47 parallel_lines(A,B) | convergent_lines(A,B) # label(a3) # label(axiom). [clausify(33)].
% 0.45/1.04 48 -orthogonal_lines(A,B) | -unorthogonal_lines(A,B) # label(a5) # label(axiom). [clausify(35)].
% 0.45/1.04 49 orthogonal_lines(A,B) | unorthogonal_lines(A,B) # label(a5) # label(axiom). [clausify(35)].
% 0.45/1.04
% 0.45/1.04 ============================== end predicate elimination =============
% 0.45/1.04
% 0.45/1.04 Auto_denials: (non-Horn, no changes).
% 0.45/1.04
% 0.45/1.04 Term ordering decisions:
% 0.45/1.04 Function symbol KB weights: c1=1. c2=1. c3=1. line_connecting=1. intersection_point=1. orthogonal_through_point=1. parallel_through_point=1.
% 0.45/1.04
% 0.45/1.04 ============================== end of process initial clauses ========
% 0.45/1.04
% 0.45/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.04
% 0.45/1.04 ============================== end of clauses for search =============
% 0.45/1.04
% 0.45/1.04 ============================== SEARCH ================================
% 0.45/1.04
% 0.45/1.04 % Starting search at 0.02 seconds.
% 0.45/1.04
% 0.45/1.04 ============================== PROOF =================================
% 0.45/1.04 % SZS status Theorem
% 0.45/1.04 % SZS output start Refutation
% 0.45/1.04
% 0.45/1.04 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.45/1.04 % Length of proof is 21.
% 0.45/1.04 % Level of proof is 3.
% 0.45/1.04 % Maximum clause weight is 18.000.
% 0.45/1.04 % Given clauses 39.
% 0.45/1.04
% 0.45/1.04 7 (all X all Y (distinct_points(X,Y) -> -apart_point_and_line(X,line_connecting(X,Y)))) # label(ci1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 8 (all X all Y (distinct_points(X,Y) -> -apart_point_and_line(Y,line_connecting(X,Y)))) # label(ci2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 11 (all X all Y all U all V (distinct_points(X,Y) & distinct_lines(U,V) -> apart_point_and_line(X,U) | apart_point_and_line(X,V) | apart_point_and_line(Y,U) | apart_point_and_line(Y,V))) # label(cu1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 32 (all X all Y (equal_lines(X,Y) <-> -distinct_lines(X,Y))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 34 (all X all Y (incident_point_and_line(X,Y) <-> -apart_point_and_line(X,Y))) # label(a4) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.04 36 -(all X all Y all Z (distinct_points(X,Y) & incident_point_and_line(X,Z) & incident_point_and_line(Y,Z) -> equal_lines(Z,line_connecting(X,Y)))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.04 37 -incident_point_and_line(A,B) | -apart_point_and_line(A,B) # label(a4) # label(axiom). [clausify(34)].
% 0.45/1.04 38 incident_point_and_line(c1,c3) # label(con) # label(negated_conjecture). [clausify(36)].
% 0.45/1.04 39 incident_point_and_line(c2,c3) # label(con) # label(negated_conjecture). [clausify(36)].
% 0.45/1.04 43 -equal_lines(c3,line_connecting(c1,c2)) # label(con) # label(negated_conjecture). [clausify(36)].
% 0.45/1.04 44 equal_lines(A,B) | distinct_lines(A,B) # label(ax2) # label(axiom). [clausify(32)].
% 0.45/1.04 50 distinct_points(c1,c2) # label(con) # label(negated_conjecture). [clausify(36)].
% 0.45/1.04 59 -distinct_points(A,B) | -apart_point_and_line(A,line_connecting(A,B)) # label(ci1) # label(axiom). [clausify(7)].
% 0.45/1.04 60 -distinct_points(A,B) | -apart_point_and_line(B,line_connecting(A,B)) # label(ci2) # label(axiom). [clausify(8)].
% 0.45/1.04 82 -distinct_points(A,B) | -distinct_lines(C,D) | apart_point_and_line(A,C) | apart_point_and_line(A,D) | apart_point_and_line(B,C) | apart_point_and_line(B,D) # label(cu1) # label(axiom). [clausify(11)].
% 0.45/1.04 83 -apart_point_and_line(c1,c3). [resolve(37,a,38,a)].
% 0.45/1.04 84 -apart_point_and_line(c2,c3). [resolve(37,a,39,a)].
% 0.45/1.04 85 distinct_lines(c3,line_connecting(c1,c2)). [resolve(43,a,44,a)].
% 0.45/1.04 87 -apart_point_and_line(c1,line_connecting(c1,c2)). [resolve(59,a,50,a)].
% 0.45/1.04 88 -apart_point_and_line(c2,line_connecting(c1,c2)). [resolve(60,a,50,a)].
% 0.45/1.04 104 $F. [ur(82,b,85,a,c,83,a,d,87,a,e,84,a,f,88,a),unit_del(a,50)].
% 0.45/1.04
% 0.45/1.04 % SZS output end Refutation
% 0.45/1.04 ============================== end of proof ==========================
% 0.45/1.04
% 0.45/1.04 ============================== STATISTICS ============================
% 0.45/1.04
% 0.45/1.04 Given=39. Generated=111. Kept=54. proofs=1.
% 0.45/1.04 Usable=39. Sos=15. Demods=0. Limbo=0, Disabled=53. Hints=0.
% 0.45/1.04 Megabytes=0.12.
% 0.45/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.45/1.04
% 0.45/1.04 ============================== end of statistics =====================
% 0.45/1.04
% 0.45/1.04 ============================== end of search =========================
% 0.45/1.04
% 0.45/1.04 THEOREM PROVED
% 0.45/1.04 % SZS status Theorem
% 0.45/1.04
% 0.45/1.04 Exiting with 1 proof.
% 0.45/1.04
% 0.45/1.04 Process 4472 exit (max_proofs) Sat Jun 18 15:42:23 2022
% 0.45/1.04 Prover9 interrupted
%------------------------------------------------------------------------------