TSTP Solution File: GEO218+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO218+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:11 EDT 2022
% Result : Theorem 0.81s 1.07s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO218+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 18:28:54 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.81/1.07 ============================== Prover9 ===============================
% 0.81/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.07 Process 25646 was started by sandbox on n019.cluster.edu,
% 0.81/1.07 Sat Jun 18 18:28:55 2022
% 0.81/1.07 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25492_n019.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_25492_n019.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 (18 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.07 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.07 15 (all L all M -(-convergent_lines(L,M) & -unorthogonal_lines(L,M))) # label(coipo1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 16 (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.81/1.07 17 (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.81/1.07 18 -(all L all M all N (-convergent_lines(L,M) & -unorthogonal_lines(L,N) -> -unorthogonal_lines(M,N))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.81/1.07
% 0.81/1.07 ============================== end of process non-clausal formulas ===
% 0.81/1.07
% 0.81/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.07
% 0.81/1.07 ============================== PREDICATE ELIMINATION =================
% 0.81/1.07
% 0.81/1.07 ============================== end predicate elimination =============
% 0.81/1.07
% 0.81/1.07 Auto_denials: (non-Horn, no changes).
% 0.81/1.07
% 0.81/1.07 Term ordering decisions:
% 0.81/1.07 Function symbol KB weights: c1=1. c2=1. c3=1. intersection_point=1. line_connecting=1.
% 0.81/1.07
% 0.81/1.07 ============================== end of process initial clauses ========
% 0.81/1.07
% 0.81/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.07
% 0.81/1.07 ============================== end of clauses for search =============
% 0.81/1.07
% 0.81/1.07 ============================== SEARCH ================================
% 0.81/1.07
% 0.81/1.07 % Starting search at 0.01 seconds.
% 0.81/1.07
% 0.81/1.07 ============================== PROOF =================================
% 0.81/1.07 % SZS status Theorem
% 0.81/1.07 % SZS output start Refutation
% 0.81/1.07
% 0.81/1.07 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.81/1.07 % Length of proof is 16.
% 0.81/1.07 % Level of proof is 4.
% 0.81/1.07 % Maximum clause weight is 12.000.
% 0.81/1.07 % Given clauses 26.
% 0.81/1.07
% 0.81/1.07 3 (all X -convergent_lines(X,X)) # label(apart3) # 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 15 (all L all M -(-convergent_lines(L,M) & -unorthogonal_lines(L,M))) # label(coipo1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 16 (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.81/1.07 18 -(all L all M all N (-convergent_lines(L,M) & -unorthogonal_lines(L,N) -> -unorthogonal_lines(M,N))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.81/1.07 19 unorthogonal_lines(c2,c3) # label(con) # label(negated_conjecture). [clausify(18)].
% 0.81/1.07 20 convergent_lines(A,B) | unorthogonal_lines(A,B) # label(coipo1) # label(axiom). [clausify(15)].
% 0.81/1.07 23 -convergent_lines(A,A) # label(apart3) # label(axiom). [clausify(3)].
% 0.81/1.07 24 -convergent_lines(c1,c2) # label(con) # label(negated_conjecture). [clausify(18)].
% 0.81/1.07 25 -unorthogonal_lines(c1,c3) # label(con) # label(negated_conjecture). [clausify(18)].
% 0.81/1.07 32 -convergent_lines(A,B) | convergent_lines(A,C) | convergent_lines(B,C) # label(ax6) # label(axiom). [clausify(6)].
% 0.81/1.07 38 convergent_lines(A,B) | unorthogonal_lines(A,C) | -convergent_lines(B,C) | -unorthogonal_lines(B,C) # label(cotno1) # label(axiom). [clausify(16)].
% 0.81/1.07 41 convergent_lines(c1,c3). [resolve(25,a,20,b)].
% 0.81/1.07 45 -convergent_lines(c2,c3). [ur(38,a,24,a,b,25,a,d,19,a)].
% 0.81/1.07 51 -convergent_lines(c3,c2). [ur(32,b,23,a,c,45,a)].
% 0.81/1.07 52 $F. [ur(32,b,24,a,c,51,a),unit_del(a,41)].
% 0.81/1.07
% 0.81/1.07 % SZS output end Refutation
% 0.81/1.07 ============================== end of proof ==========================
% 0.81/1.07
% 0.81/1.07 ============================== STATISTICS ============================
% 0.81/1.07
% 0.81/1.07 Given=26. Generated=73. Kept=33. proofs=1.
% 0.81/1.07 Usable=26. Sos=5. Demods=0. Limbo=0, Disabled=25. Hints=0.
% 0.81/1.07 Megabytes=0.07.
% 0.81/1.07 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.81/1.07
% 0.81/1.07 ============================== end of statistics =====================
% 0.81/1.07
% 0.81/1.07 ============================== end of search =========================
% 0.81/1.07
% 0.81/1.07 THEOREM PROVED
% 0.81/1.07 % SZS status Theorem
% 0.81/1.07
% 0.81/1.07 Exiting with 1 proof.
% 0.81/1.07
% 0.81/1.07 Process 25646 exit (max_proofs) Sat Jun 18 18:28:55 2022
% 0.81/1.07 Prover9 interrupted
%------------------------------------------------------------------------------