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