TSTP Solution File: GEO222+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO222+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:15 EDT 2022
% Result : Theorem 0.81s 1.08s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO222+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Fri Jun 17 21:02:04 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.81/1.07 ============================== Prover9 ===============================
% 0.81/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.07 Process 29537 was started by sandbox2 on n020.cluster.edu,
% 0.81/1.07 Fri Jun 17 21:02:04 2022
% 0.81/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29384_n020.cluster.edu".
% 0.81/1.07 ============================== end of head ===========================
% 0.81/1.07
% 0.81/1.07 ============================== INPUT =================================
% 0.81/1.07
% 0.81/1.07 % Reading from file /tmp/Prover9_29384_n020.cluster.edu
% 0.81/1.07
% 0.81/1.07 set(prolog_style_variables).
% 0.81/1.07 set(auto2).
% 0.81/1.07 % set(auto2) -> set(auto).
% 0.81/1.07 % set(auto) -> set(auto_inference).
% 0.81/1.07 % set(auto) -> set(auto_setup).
% 0.81/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.07 % set(auto) -> set(auto_limits).
% 0.81/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.07 % set(auto) -> set(auto_denials).
% 0.81/1.07 % set(auto) -> set(auto_process).
% 0.81/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.07 % set(auto2) -> assign(stats, some).
% 0.81/1.07 % set(auto2) -> clear(echo_input).
% 0.81/1.07 % set(auto2) -> set(quiet).
% 0.81/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.07 % set(auto2) -> clear(print_given).
% 0.81/1.07 assign(lrs_ticks,-1).
% 0.81/1.07 assign(sos_limit,10000).
% 0.81/1.07 assign(order,kbo).
% 0.81/1.07 set(lex_order_vars).
% 0.81/1.07 clear(print_given).
% 0.81/1.07
% 0.81/1.07 % formulas(sos). % not echoed (23 formulas)
% 0.81/1.07
% 0.81/1.07 ============================== end of input ==========================
% 0.81/1.07
% 0.81/1.07 % From the command line: assign(max_seconds, 300).
% 0.81/1.07
% 0.81/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.07
% 0.81/1.07 % Formulas that are not ordinary clauses:
% 0.81/1.07 1 (all X -distinct_points(X,X)) # label(apart1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 2 (all X -distinct_lines(X,X)) # label(apart2) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 3 (all X -convergent_lines(X,X)) # label(apart3) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 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.81/1.07 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.81/1.07 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.81/1.07 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.81/1.07 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.81/1.07 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.81/1.07 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.81/1.07 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.81/1.07 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.81/1.07 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.81/1.08 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.81/1.08 15 (all X all Y -convergent_lines(parallel_through_point(Y,X),Y)) # label(cp1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 16 (all X all Y -apart_point_and_line(X,parallel_through_point(Y,X))) # label(cp2) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 17 (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.81/1.08 18 (all L all M (convergent_lines(L,M) | unorthogonal_lines(L,M))) # label(occu1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 19 (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.81/1.08 20 (all A all L -unorthogonal_lines(orthogonal_through_point(L,A),L)) # label(ooc1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 21 (all A all L -apart_point_and_line(A,orthogonal_through_point(L,A))) # label(ooc2) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 22 (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.81/1.08 23 -(all A all L -convergent_lines(L,orthogonal_through_point(orthogonal_through_point(L,A),A))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.81/1.08
% 0.81/1.08 ============================== end of process non-clausal formulas ===
% 0.81/1.08
% 0.81/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.08
% 0.81/1.08 ============================== PREDICATE ELIMINATION =================
% 0.81/1.08
% 0.81/1.08 ============================== end predicate elimination =============
% 0.81/1.08
% 0.81/1.08 Auto_denials: (non-Horn, no changes).
% 0.81/1.08
% 0.81/1.08 Term ordering decisions:
% 0.81/1.08 Function symbol KB weights: c1=1. c2=1. orthogonal_through_point=1. intersection_point=1. line_connecting=1. parallel_through_point=1.
% 0.81/1.08
% 0.81/1.08 ============================== end of process initial clauses ========
% 0.81/1.08
% 0.81/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.08
% 0.81/1.08 ============================== end of clauses for search =============
% 0.81/1.08
% 0.81/1.08 ============================== SEARCH ================================
% 0.81/1.08
% 0.81/1.08 % Starting search at 0.01 seconds.
% 0.81/1.08
% 0.81/1.08 ============================== PROOF =================================
% 0.81/1.08 % SZS status Theorem
% 0.81/1.08 % SZS output start Refutation
% 0.81/1.08
% 0.81/1.08 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.81/1.08 % Length of proof is 31.
% 0.81/1.08 % Level of proof is 7.
% 0.81/1.08 % Maximum clause weight is 15.000.
% 0.81/1.08 % Given clauses 47.
% 0.81/1.08
% 0.81/1.08 3 (all X -convergent_lines(X,X)) # label(apart3) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 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.81/1.08 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.81/1.08 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.81/1.08 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.81/1.08 18 (all L all M (convergent_lines(L,M) | unorthogonal_lines(L,M))) # label(occu1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 19 (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.81/1.08 20 (all A all L -unorthogonal_lines(orthogonal_through_point(L,A),L)) # label(ooc1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 22 (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.81/1.08 23 -(all A all L -convergent_lines(L,orthogonal_through_point(orthogonal_through_point(L,A),A))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.81/1.08 24 convergent_lines(A,B) | unorthogonal_lines(A,B) # label(occu1) # label(axiom). [clausify(18)].
% 0.81/1.08 25 convergent_lines(c2,orthogonal_through_point(orthogonal_through_point(c2,c1),c1)) # label(con) # label(negated_conjecture). [clausify(23)].
% 0.81/1.08 28 -convergent_lines(A,A) # label(apart3) # label(axiom). [clausify(3)].
% 0.81/1.08 31 -unorthogonal_lines(orthogonal_through_point(A,B),A) # label(ooc1) # label(axiom). [clausify(20)].
% 0.81/1.08 35 -convergent_lines(A,B) | -apart_point_and_line(intersection_point(A,B),A) # label(ci3) # label(axiom). [clausify(9)].
% 0.81/1.08 36 -convergent_lines(A,B) | -apart_point_and_line(intersection_point(A,B),B) # label(ci4) # label(axiom). [clausify(10)].
% 0.81/1.08 39 -convergent_lines(A,B) | convergent_lines(A,C) | convergent_lines(B,C) # label(ax6) # label(axiom). [clausify(6)].
% 0.81/1.08 42 -convergent_lines(A,B) | distinct_lines(B,C) | convergent_lines(A,C) # label(ceq3) # label(axiom). [clausify(14)].
% 0.81/1.08 44 -convergent_lines(A,B) | -unorthogonal_lines(A,B) | convergent_lines(A,C) | unorthogonal_lines(B,C) # label(oac1) # label(axiom). [clausify(19)].
% 0.81/1.08 47 -distinct_lines(A,B) | apart_point_and_line(C,A) | apart_point_and_line(C,B) | unorthogonal_lines(A,D) | unorthogonal_lines(B,D) # label(ouo1) # label(axiom). [clausify(22)].
% 0.81/1.08 49 convergent_lines(orthogonal_through_point(A,B),A). [resolve(31,a,24,b)].
% 0.81/1.08 50 -apart_point_and_line(intersection_point(c2,orthogonal_through_point(orthogonal_through_point(c2,c1),c1)),c2). [ur(35,a,25,a)].
% 0.81/1.08 51 -apart_point_and_line(intersection_point(c2,orthogonal_through_point(orthogonal_through_point(c2,c1),c1)),orthogonal_through_point(orthogonal_through_point(c2,c1),c1)). [ur(36,a,25,a)].
% 0.81/1.08 52 convergent_lines(c2,A) | convergent_lines(orthogonal_through_point(orthogonal_through_point(c2,c1),c1),A). [resolve(39,a,25,a)].
% 0.81/1.08 59 convergent_lines(orthogonal_through_point(A,B),C) | convergent_lines(A,C). [resolve(49,a,39,a)].
% 0.81/1.08 87 convergent_lines(A,orthogonal_through_point(A,B)). [resolve(59,a,28,a)].
% 0.81/1.08 90 -unorthogonal_lines(A,orthogonal_through_point(A,B)). [ur(44,a,87,a,c,28,a,d,31,a)].
% 0.81/1.08 143 convergent_lines(c2,A) | convergent_lines(orthogonal_through_point(orthogonal_through_point(c2,c1),c1),B) | convergent_lines(A,B). [resolve(52,b,39,a)].
% 0.81/1.08 144 convergent_lines(orthogonal_through_point(orthogonal_through_point(c2,c1),c1),c2). [factor(143,a,c),unit_del(a,28)].
% 0.81/1.08 149 -distinct_lines(c2,orthogonal_through_point(orthogonal_through_point(c2,c1),c1)). [ur(47,b,50,a,c,51,a,d,90,a,e,31,a)].
% 0.81/1.08 182 $F. [ur(42,b,149,a,c,28,a),unit_del(a,144)].
% 0.81/1.08
% 0.81/1.08 % SZS output end Refutation
% 0.81/1.08 ============================== end of proof ==========================
% 0.81/1.08
% 0.81/1.08 ============================== STATISTICS ============================
% 0.81/1.08
% 0.81/1.08 Given=47. Generated=320. Kept=158. proofs=1.
% 0.81/1.08 Usable=47. Sos=107. Demods=0. Limbo=3, Disabled=27. Hints=0.
% 0.81/1.08 Megabytes=0.20.
% 0.81/1.08 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.81/1.08
% 0.81/1.08 ============================== end of statistics =====================
% 0.81/1.08
% 0.81/1.08 ============================== end of search =========================
% 0.81/1.08
% 0.81/1.08 THEOREM PROVED
% 0.81/1.08 % SZS status Theorem
% 0.81/1.08
% 0.81/1.08 Exiting with 1 proof.
% 0.81/1.08
% 0.81/1.08 Process 29537 exit (max_proofs) Fri Jun 17 21:02:04 2022
% 0.81/1.08 Prover9 interrupted
%------------------------------------------------------------------------------