TSTP Solution File: GEO205+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO205+2 : TPTP v8.1.0. Released v3.3.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:01 EDT 2022
% Result : Theorem 0.68s 0.99s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GEO205+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jun 18 16:03:53 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.68/0.98 ============================== Prover9 ===============================
% 0.68/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.98 Process 4256 was started by sandbox on n005.cluster.edu,
% 0.68/0.98 Sat Jun 18 16:03:54 2022
% 0.68/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4103_n005.cluster.edu".
% 0.68/0.98 ============================== end of head ===========================
% 0.68/0.98
% 0.68/0.98 ============================== INPUT =================================
% 0.68/0.98
% 0.68/0.98 % Reading from file /tmp/Prover9_4103_n005.cluster.edu
% 0.68/0.98
% 0.68/0.98 set(prolog_style_variables).
% 0.68/0.98 set(auto2).
% 0.68/0.98 % set(auto2) -> set(auto).
% 0.68/0.98 % set(auto) -> set(auto_inference).
% 0.68/0.98 % set(auto) -> set(auto_setup).
% 0.68/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.98 % set(auto) -> set(auto_limits).
% 0.68/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.98 % set(auto) -> set(auto_denials).
% 0.68/0.98 % set(auto) -> set(auto_process).
% 0.68/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.98 % set(auto2) -> assign(stats, some).
% 0.68/0.98 % set(auto2) -> clear(echo_input).
% 0.68/0.98 % set(auto2) -> set(quiet).
% 0.68/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.98 % set(auto2) -> clear(print_given).
% 0.68/0.98 assign(lrs_ticks,-1).
% 0.68/0.98 assign(sos_limit,10000).
% 0.68/0.98 assign(order,kbo).
% 0.68/0.98 set(lex_order_vars).
% 0.68/0.98 clear(print_given).
% 0.68/0.98
% 0.68/0.98 % formulas(sos). % not echoed (13 formulas)
% 0.68/0.98
% 0.68/0.98 ============================== end of input ==========================
% 0.68/0.98
% 0.68/0.98 % From the command line: assign(max_seconds, 300).
% 0.68/0.98
% 0.68/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.98
% 0.68/0.98 % Formulas that are not ordinary clauses:
% 0.68/0.98 1 (all X -distinct_points(X,X)) # label(apart1) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 2 (all X -distinct_lines(X,X)) # label(apart2) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 3 (all X -convergent_lines(X,X)) # label(apart3) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 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.68/0.98 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.68/0.98 6 (all X all Y all Z (convergent_lines(X,Y) -> convergent_lines(X,Z) | convergent_lines(Y,Z))) # label(apart6) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 7 (all X all Y all Z (distinct_points(X,Y) -> (apart_point_and_line(Z,line_connecting(X,Y)) -> distinct_points(Z,X) & distinct_points(Z,Y)))) # label(con1) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 8 (all X all Y all Z (convergent_lines(X,Y) -> (apart_point_and_line(Z,X) | apart_point_and_line(Z,Y) -> distinct_points(Z,intersection_point(X,Y))))) # label(con2) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 9 (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.68/0.98 10 (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.68/0.98 11 (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.68/0.98 12 (all X all Y (convergent_lines(X,Y) -> distinct_lines(X,Y))) # label(ceq3) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 13 -(all X all Y all Z (convergent_lines(X,Y) & -distinct_lines(Y,Z) -> convergent_lines(X,Z) & -distinct_points(intersection_point(X,Y),intersection_point(X,Z)))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.68/0.98
% 0.68/0.98 ============================== end of process non-clausal formulas ===
% 0.68/0.98
% 0.68/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.98
% 0.68/0.98 ============================== PREDICATE ELIMINATION =================
% 0.68/0.98
% 0.68/0.98 ============================== end predicate elimination =============
% 0.68/0.98
% 0.68/0.98 Auto_denials: (non-Horn, no changes).
% 0.68/0.98
% 0.68/0.98 Term ordering decisions:
% 0.68/0.98 Function symbol KB weights: c1=1. c2=1. c3=1. intersection_point=1. line_connecting=1.
% 0.68/0.98
% 0.68/0.98 ============================== end of process initial clauses ========
% 0.68/0.98
% 0.68/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.98
% 0.68/0.98 ============================== end of clauses for search =============
% 0.68/0.98
% 0.68/0.98 ============================== SEARCH ================================
% 0.68/0.98
% 0.68/0.98 % Starting search at 0.01 seconds.
% 0.68/0.98
% 0.68/0.98 ============================== PROOF =================================
% 0.68/0.99 % SZS status Theorem
% 0.68/0.99 % SZS output start Refutation
% 0.68/0.99
% 0.68/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.68/0.99 % Length of proof is 33.
% 0.68/0.99 % Level of proof is 5.
% 0.68/0.99 % Maximum clause weight is 18.000.
% 0.68/0.99 % Given clauses 38.
% 0.68/0.99
% 0.68/0.99 1 (all X -distinct_points(X,X)) # label(apart1) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 2 (all X -distinct_lines(X,X)) # label(apart2) # label(axiom) # label(non_clause). [assumption].
% 0.68/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.68/0.99 6 (all X all Y all Z (convergent_lines(X,Y) -> convergent_lines(X,Z) | convergent_lines(Y,Z))) # label(apart6) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 8 (all X all Y all Z (convergent_lines(X,Y) -> (apart_point_and_line(Z,X) | apart_point_and_line(Z,Y) -> distinct_points(Z,intersection_point(X,Y))))) # label(con2) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 9 (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.68/0.99 11 (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.68/0.99 12 (all X all Y (convergent_lines(X,Y) -> distinct_lines(X,Y))) # label(ceq3) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 13 -(all X all Y all Z (convergent_lines(X,Y) & -distinct_lines(Y,Z) -> convergent_lines(X,Z) & -distinct_points(intersection_point(X,Y),intersection_point(X,Z)))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.68/0.99 14 convergent_lines(c1,c2) # label(con) # label(negated_conjecture). [clausify(13)].
% 0.68/0.99 15 -distinct_points(A,A) # label(apart1) # label(axiom). [clausify(1)].
% 0.68/0.99 16 -distinct_lines(A,A) # label(apart2) # label(axiom). [clausify(2)].
% 0.68/0.99 18 -distinct_lines(c2,c3) # label(con) # label(negated_conjecture). [clausify(13)].
% 0.68/0.99 19 -convergent_lines(A,B) | distinct_lines(A,B) # label(ceq3) # label(axiom). [clausify(12)].
% 0.68/0.99 21 -distinct_lines(A,B) | distinct_lines(A,C) | distinct_lines(B,C) # label(apart5) # label(axiom). [clausify(5)].
% 0.68/0.99 22 -convergent_lines(A,B) | convergent_lines(A,C) | convergent_lines(B,C) # label(apart6) # label(axiom). [clausify(6)].
% 0.68/0.99 24 -apart_point_and_line(A,B) | distinct_lines(B,C) | apart_point_and_line(A,C) # label(ceq2) # label(axiom). [clausify(11)].
% 0.68/0.99 25 -convergent_lines(c1,c3) | distinct_points(intersection_point(c1,c2),intersection_point(c1,c3)) # label(con) # label(negated_conjecture). [clausify(13)].
% 0.68/0.99 28 -convergent_lines(A,B) | -apart_point_and_line(C,A) | distinct_points(C,intersection_point(A,B)) # label(con2) # label(axiom). [clausify(8)].
% 0.68/0.99 29 -convergent_lines(A,B) | -apart_point_and_line(C,B) | distinct_points(C,intersection_point(A,B)) # label(con2) # label(axiom). [clausify(8)].
% 0.68/0.99 30 -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(9)].
% 0.68/0.99 32 -convergent_lines(c2,c3). [ur(19,b,18,a)].
% 0.68/0.99 33 -distinct_lines(c3,c2). [ur(21,b,16,a,c,18,a)].
% 0.68/0.99 34 convergent_lines(c1,A) | convergent_lines(c2,A). [resolve(22,a,14,a)].
% 0.68/0.99 36 -apart_point_and_line(intersection_point(c1,c2),c1). [ur(28,a,14,a,c,15,a)].
% 0.68/0.99 38 -apart_point_and_line(intersection_point(c1,c2),c2). [ur(29,a,14,a,c,15,a)].
% 0.68/0.99 42 convergent_lines(c1,c3). [resolve(34,b,32,a)].
% 0.68/0.99 47 distinct_points(intersection_point(c1,c2),intersection_point(c1,c3)). [back_unit_del(25),unit_del(a,42)].
% 0.68/0.99 52 distinct_lines(c1,c3). [resolve(42,a,19,a)].
% 0.68/0.99 53 -apart_point_and_line(intersection_point(c1,c3),c3). [ur(29,a,42,a,c,15,a)].
% 0.68/0.99 54 -apart_point_and_line(intersection_point(c1,c3),c1). [ur(28,a,42,a,c,15,a)].
% 0.68/0.99 62 -apart_point_and_line(intersection_point(c1,c2),c3). [ur(24,b,33,a,c,38,a)].
% 0.68/0.99 77 $F. [ur(30,b,52,a,c,36,a,d,62,a,e,54,a,f,53,a),unit_del(a,47)].
% 0.68/0.99
% 0.68/0.99 % SZS output end Refutation
% 0.68/0.99 ============================== end of proof ==========================
% 0.68/0.99
% 0.68/0.99 ============================== STATISTICS ============================
% 0.68/0.99
% 0.68/0.99 Given=38. Generated=148. Kept=63. proofs=1.
% 0.68/0.99 Usable=37. Sos=24. Demods=0. Limbo=1, Disabled=18. Hints=0.
% 0.68/0.99 Megabytes=0.09.
% 0.68/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.68/0.99
% 0.68/0.99 ============================== end of statistics =====================
% 0.68/0.99
% 0.68/0.99 ============================== end of search =========================
% 0.68/0.99
% 0.68/0.99 THEOREM PROVED
% 0.68/0.99 % SZS status Theorem
% 0.68/0.99
% 0.68/0.99 Exiting with 1 proof.
% 0.68/0.99
% 0.68/0.99 Process 4256 exit (max_proofs) Sat Jun 18 16:03:54 2022
% 0.68/0.99 Prover9 interrupted
%------------------------------------------------------------------------------