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