TSTP Solution File: GEO225+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO225+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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:55:18 EDT 2022
% Result : Theorem 0.41s 1.00s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO225+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n005.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 10:37:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.99 ============================== Prover9 ===============================
% 0.41/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.99 Process 20001 was started by sandbox on n005.cluster.edu,
% 0.41/0.99 Sat Jun 18 10:37:39 2022
% 0.41/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19848_n005.cluster.edu".
% 0.41/0.99 ============================== end of head ===========================
% 0.41/0.99
% 0.41/0.99 ============================== INPUT =================================
% 0.41/0.99
% 0.41/0.99 % Reading from file /tmp/Prover9_19848_n005.cluster.edu
% 0.41/0.99
% 0.41/0.99 set(prolog_style_variables).
% 0.41/0.99 set(auto2).
% 0.41/0.99 % set(auto2) -> set(auto).
% 0.41/0.99 % set(auto) -> set(auto_inference).
% 0.41/0.99 % set(auto) -> set(auto_setup).
% 0.41/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.99 % set(auto) -> set(auto_limits).
% 0.41/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.99 % set(auto) -> set(auto_denials).
% 0.41/0.99 % set(auto) -> set(auto_process).
% 0.41/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.99 % set(auto2) -> assign(stats, some).
% 0.41/0.99 % set(auto2) -> clear(echo_input).
% 0.41/0.99 % set(auto2) -> set(quiet).
% 0.41/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.99 % set(auto2) -> clear(print_given).
% 0.41/0.99 assign(lrs_ticks,-1).
% 0.41/0.99 assign(sos_limit,10000).
% 0.41/0.99 assign(order,kbo).
% 0.41/0.99 set(lex_order_vars).
% 0.41/0.99 clear(print_given).
% 0.41/0.99
% 0.41/0.99 % formulas(sos). % not echoed (36 formulas)
% 0.41/0.99
% 0.41/0.99 ============================== end of input ==========================
% 0.41/0.99
% 0.41/0.99 % From the command line: assign(max_seconds, 300).
% 0.41/0.99
% 0.41/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.99
% 0.41/0.99 % Formulas that are not ordinary clauses:
% 0.41/0.99 1 (all X -distinct_points(X,X)) # label(apart1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 2 (all X -distinct_lines(X,X)) # label(apart2) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 3 (all X -convergent_lines(X,X)) # label(apart3) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 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.41/0.99 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.41/0.99 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.41/0.99 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.41/0.99 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.41/0.99 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.41/0.99 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.41/0.99 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.41/0.99 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.41/0.99 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.41/0.99 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.41/0.99 15 (all X all Y (distinct_lines(X,Y) -> convergent_lines(X,Y))) # label(p1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 16 (all X all Y -convergent_lines(parallel_through_point(Y,X),Y)) # label(cp1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 17 (all X all Y -apart_point_and_line(X,parallel_through_point(Y,X))) # label(cp2) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 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.41/0.99 19 (all L all M (convergent_lines(L,M) | unorthogonal_lines(L,M))) # label(occu1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 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.41/0.99 21 (all A all L -unorthogonal_lines(orthogonal_through_point(L,A),L)) # label(ooc1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 22 (all A all L -apart_point_and_line(A,orthogonal_through_point(L,A))) # label(ooc2) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 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.41/0.99 24 (all L all M -(-convergent_lines(L,M) & -unorthogonal_lines(L,M))) # label(coipo1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 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.41/0.99 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.41/0.99 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.41/0.99 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.41/0.99 29 (all L all A (line(L) & point(A) -> line(parallel_through_point(L,A)))) # label(par1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 30 (all L all A (line(L) & point(A) -> line(orthogonal_through_point(L,A)))) # label(orth1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 31 (all X all Y (equal_points(X,Y) <-> -distinct_points(X,Y))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 32 (all X all Y (equal_lines(X,Y) <-> -distinct_lines(X,Y))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 33 (all X all Y (parallel_lines(X,Y) <-> -convergent_lines(X,Y))) # label(a3) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 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.41/0.99 35 (all X all Y (orthogonal_lines(X,Y) <-> -unorthogonal_lines(X,Y))) # label(a5) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 36 -(all A all B (point(A) & point(B) & distinct_points(A,B) -> (exists X (line(X) -> incident_point_and_line(A,X) & incident_point_and_line(B,X))))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/0.99
% 0.41/0.99 ============================== end of process non-clausal formulas ===
% 0.41/0.99
% 0.41/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.99
% 0.41/0.99 ============================== PREDICATE ELIMINATION =================
% 0.41/0.99 37 -equal_points(A,B) | -distinct_points(A,B) # label(ax1) # label(axiom). [clausify(31)].
% 0.41/0.99 38 equal_points(A,B) | distinct_points(A,B) # label(ax1) # label(axiom). [clausify(31)].
% 0.41/0.99 39 -equal_lines(A,B) | -distinct_lines(A,B) # label(ax2) # label(axiom). [clausify(32)].
% 0.41/1.00 40 equal_lines(A,B) | distinct_lines(A,B) # label(ax2) # label(axiom). [clausify(32)].
% 0.41/1.00 41 -parallel_lines(A,B) | -convergent_lines(A,B) # label(a3) # label(axiom). [clausify(33)].
% 0.41/1.00 42 parallel_lines(A,B) | convergent_lines(A,B) # label(a3) # label(axiom). [clausify(33)].
% 0.41/1.00 43 -orthogonal_lines(A,B) | -unorthogonal_lines(A,B) # label(a5) # label(axiom). [clausify(35)].
% 0.41/1.00 44 orthogonal_lines(A,B) | unorthogonal_lines(A,B) # label(a5) # label(axiom). [clausify(35)].
% 0.41/1.00
% 0.41/1.00 ============================== end predicate elimination =============
% 0.41/1.00
% 0.41/1.00 Auto_denials: (non-Horn, no changes).
% 0.41/1.00
% 0.41/1.00 Term ordering decisions:
% 0.41/1.00 Function symbol KB weights: c1=1. c2=1. intersection_point=1. line_connecting=1. orthogonal_through_point=1. parallel_through_point=1.
% 0.41/1.00
% 0.41/1.00 ============================== end of process initial clauses ========
% 0.41/1.00
% 0.41/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.41/1.00
% 0.41/1.00 ============================== end of clauses for search =============
% 0.41/1.00
% 0.41/1.00 ============================== SEARCH ================================
% 0.41/1.00
% 0.41/1.00 % Starting search at 0.02 seconds.
% 0.41/1.00
% 0.41/1.00 ============================== PROOF =================================
% 0.41/1.00 % SZS status Theorem
% 0.41/1.00 % SZS output start Refutation
% 0.41/1.00
% 0.41/1.00 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.41/1.00 % Length of proof is 22.
% 0.41/1.00 % Level of proof is 5.
% 0.41/1.00 % Maximum clause weight is 9.000.
% 0.41/1.00 % Given clauses 47.
% 0.41/1.00
% 0.41/1.00 2 (all X -distinct_lines(X,X)) # label(apart2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 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.41/1.00 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.41/1.00 15 (all X all Y (distinct_lines(X,Y) -> convergent_lines(X,Y))) # label(p1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 16 (all X all Y -convergent_lines(parallel_through_point(Y,X),Y)) # label(cp1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 17 (all X all Y -apart_point_and_line(X,parallel_through_point(Y,X))) # label(cp2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 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.41/1.00 36 -(all A all B (point(A) & point(B) & distinct_points(A,B) -> (exists X (line(X) -> incident_point_and_line(A,X) & incident_point_and_line(B,X))))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/1.00 50 incident_point_and_line(A,B) | apart_point_and_line(A,B) # label(a4) # label(axiom). [clausify(34)].
% 0.41/1.00 52 -distinct_lines(A,A) # label(apart2) # label(axiom). [clausify(2)].
% 0.41/1.00 54 -convergent_lines(parallel_through_point(A,B),A) # label(cp1) # label(axiom). [clausify(16)].
% 0.41/1.00 55 -apart_point_and_line(A,parallel_through_point(B,A)) # label(cp2) # label(axiom). [clausify(17)].
% 0.41/1.00 59 -incident_point_and_line(c1,A) | -incident_point_and_line(c2,A) # label(con) # label(negated_conjecture). [clausify(36)].
% 0.41/1.00 64 -distinct_lines(A,B) | convergent_lines(A,B) # label(p1) # label(axiom). [clausify(15)].
% 0.41/1.00 68 -distinct_lines(A,B) | distinct_lines(A,C) | distinct_lines(B,C) # label(apart5) # label(axiom). [clausify(5)].
% 0.41/1.00 71 -apart_point_and_line(A,B) | distinct_lines(B,C) | apart_point_and_line(A,C) # label(ceq2) # label(axiom). [clausify(13)].
% 0.41/1.00 85 -incident_point_and_line(c1,A) | apart_point_and_line(c2,A). [resolve(59,b,50,a)].
% 0.41/1.00 88 -distinct_lines(parallel_through_point(A,B),A). [ur(64,b,54,a)].
% 0.41/1.00 104 -distinct_lines(A,parallel_through_point(A,B)). [ur(68,b,52,a,c,88,a)].
% 0.41/1.00 107 apart_point_and_line(c2,A) | apart_point_and_line(c1,A). [resolve(85,a,50,a)].
% 0.41/1.00 120 -apart_point_and_line(A,B). [ur(71,b,104,a,c,55,a)].
% 0.41/1.00 124 $F. [back_unit_del(107),unit_del(a,120),unit_del(b,120)].
% 0.41/1.00
% 0.41/1.00 % SZS output end Refutation
% 0.41/1.00 ============================== end of proof ==========================
% 0.41/1.00
% 0.41/1.00 ============================== STATISTICS ============================
% 0.41/1.00
% 0.41/1.00 Given=47. Generated=172. Kept=76. proofs=1.
% 0.41/1.00 Usable=36. Sos=12. Demods=0. Limbo=4, Disabled=75. Hints=0.
% 0.41/1.00 Megabytes=0.13.
% 0.41/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.41/1.00
% 0.41/1.00 ============================== end of statistics =====================
% 0.41/1.00
% 0.41/1.00 ============================== end of search =========================
% 0.41/1.00
% 0.41/1.00 THEOREM PROVED
% 0.41/1.00 % SZS status Theorem
% 0.41/1.00
% 0.41/1.00 Exiting with 1 proof.
% 0.41/1.00
% 0.41/1.00 Process 20001 exit (max_proofs) Sat Jun 18 10:37:39 2022
% 0.41/1.00 Prover9 interrupted
%------------------------------------------------------------------------------