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