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