TSTP Solution File: GEO206+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO206+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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.45s 1.02s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO206+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n026.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 02:22:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.01 ============================== Prover9 ===============================
% 0.45/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01 Process 13835 was started by sandbox2 on n026.cluster.edu,
% 0.45/1.01 Sat Jun 18 02:22:10 2022
% 0.45/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13454_n026.cluster.edu".
% 0.45/1.01 ============================== end of head ===========================
% 0.45/1.01
% 0.45/1.01 ============================== INPUT =================================
% 0.45/1.01
% 0.45/1.01 % Reading from file /tmp/Prover9_13454_n026.cluster.edu
% 0.45/1.01
% 0.45/1.01 set(prolog_style_variables).
% 0.45/1.01 set(auto2).
% 0.45/1.01 % set(auto2) -> set(auto).
% 0.45/1.01 % set(auto) -> set(auto_inference).
% 0.45/1.01 % set(auto) -> set(auto_setup).
% 0.45/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01 % set(auto) -> set(auto_limits).
% 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01 % set(auto) -> set(auto_denials).
% 0.45/1.01 % set(auto) -> set(auto_process).
% 0.45/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.01 % set(auto2) -> assign(stats, some).
% 0.45/1.01 % set(auto2) -> clear(echo_input).
% 0.45/1.01 % set(auto2) -> set(quiet).
% 0.45/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.01 % set(auto2) -> clear(print_given).
% 0.45/1.01 assign(lrs_ticks,-1).
% 0.45/1.01 assign(sos_limit,10000).
% 0.45/1.01 assign(order,kbo).
% 0.45/1.01 set(lex_order_vars).
% 0.45/1.01 clear(print_given).
% 0.45/1.01
% 0.45/1.01 % formulas(sos). % not echoed (18 formulas)
% 0.45/1.01
% 0.45/1.01 ============================== end of input ==========================
% 0.45/1.01
% 0.45/1.01 % From the command line: assign(max_seconds, 300).
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.01
% 0.45/1.01 % Formulas that are not ordinary clauses:
% 0.45/1.01 1 (all X -distinct_points(X,X)) # label(apart1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 2 (all X -distinct_lines(X,X)) # label(apart2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 3 (all X -convergent_lines(X,X)) # label(apart3) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 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.45/1.01 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.45/1.01 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.45/1.01 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.45/1.01 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.45/1.01 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.45/1.01 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.45/1.01 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.45/1.01 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.45/1.01 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.45/1.02 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.45/1.02 15 (all X all Y -convergent_lines(parallel_through_point(Y,X),Y)) # label(cp1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 16 (all X all Y -apart_point_and_line(X,parallel_through_point(Y,X))) # label(cp2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 17 (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.45/1.02 18 -(all X all Y all Z (-apart_point_and_line(X,Y) & -convergent_lines(Y,Z) -> -distinct_lines(Y,parallel_through_point(Z,X)))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.02
% 0.45/1.02 ============================== end of process non-clausal formulas ===
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.02
% 0.45/1.02 ============================== PREDICATE ELIMINATION =================
% 0.45/1.02
% 0.45/1.02 ============================== end predicate elimination =============
% 0.45/1.02
% 0.45/1.02 Auto_denials: (non-Horn, no changes).
% 0.45/1.02
% 0.45/1.02 Term ordering decisions:
% 0.45/1.02 Function symbol KB weights: c1=1. c2=1. c3=1. parallel_through_point=1. intersection_point=1. line_connecting=1.
% 0.45/1.02
% 0.45/1.02 ============================== end of process initial clauses ========
% 0.45/1.02
% 0.45/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.02
% 0.45/1.02 ============================== end of clauses for search =============
% 0.45/1.02
% 0.45/1.02 ============================== SEARCH ================================
% 0.45/1.02
% 0.45/1.02 % Starting search at 0.01 seconds.
% 0.45/1.02
% 0.45/1.02 ============================== PROOF =================================
% 0.45/1.02 % SZS status Theorem
% 0.45/1.02 % SZS output start Refutation
% 0.45/1.02
% 0.45/1.02 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.45/1.02 % Length of proof is 21.
% 0.45/1.02 % Level of proof is 5.
% 0.45/1.02 % Maximum clause weight is 12.000.
% 0.45/1.02 % Given clauses 23.
% 0.45/1.02
% 0.45/1.02 2 (all X -distinct_lines(X,X)) # label(apart2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 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.45/1.02 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.45/1.02 15 (all X all Y -convergent_lines(parallel_through_point(Y,X),Y)) # label(cp1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 16 (all X all Y -apart_point_and_line(X,parallel_through_point(Y,X))) # label(cp2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 17 (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.45/1.02 18 -(all X all Y all Z (-apart_point_and_line(X,Y) & -convergent_lines(Y,Z) -> -distinct_lines(Y,parallel_through_point(Z,X)))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.02 19 distinct_lines(c2,parallel_through_point(c3,c1)) # label(con) # label(negated_conjecture). [clausify(18)].
% 0.45/1.02 21 -distinct_lines(A,A) # label(apart2) # label(axiom). [clausify(2)].
% 0.45/1.02 23 -apart_point_and_line(c1,c2) # label(con) # label(negated_conjecture). [clausify(18)].
% 0.45/1.02 24 -convergent_lines(c2,c3) # label(con) # label(negated_conjecture). [clausify(18)].
% 0.45/1.02 25 -convergent_lines(parallel_through_point(A,B),A) # label(cp1) # label(axiom). [clausify(15)].
% 0.45/1.02 26 -apart_point_and_line(A,parallel_through_point(B,A)) # label(cp2) # label(axiom). [clausify(16)].
% 0.45/1.02 32 -distinct_lines(A,B) | distinct_lines(A,C) | distinct_lines(B,C) # label(apart5) # label(axiom). [clausify(5)].
% 0.45/1.02 33 -convergent_lines(A,B) | convergent_lines(A,C) | convergent_lines(B,C) # label(ax6) # label(axiom). [clausify(6)].
% 0.45/1.02 37 -distinct_lines(A,B) | apart_point_and_line(C,A) | apart_point_and_line(C,B) | convergent_lines(A,B) # label(cup1) # label(axiom). [clausify(17)].
% 0.45/1.02 39 distinct_lines(c2,A) | distinct_lines(parallel_through_point(c3,c1),A). [resolve(32,a,19,a)].
% 0.45/1.02 41 -convergent_lines(parallel_through_point(c3,A),c2). [ur(33,b,25,a,c,24,a)].
% 0.45/1.02 49 distinct_lines(c2,A) | distinct_lines(parallel_through_point(c3,c1),B) | distinct_lines(A,B). [resolve(39,b,32,a)].
% 0.45/1.02 50 distinct_lines(parallel_through_point(c3,c1),c2). [factor(49,a,c),unit_del(a,21)].
% 0.45/1.02 53 $F. [ur(37,b,26,a,c,23,a,d,41,a),unit_del(a,50)].
% 0.45/1.02
% 0.45/1.02 % SZS output end Refutation
% 0.45/1.02 ============================== end of proof ==========================
% 0.45/1.02
% 0.45/1.02 ============================== STATISTICS ============================
% 0.45/1.02
% 0.45/1.02 Given=23. Generated=69. Kept=34. proofs=1.
% 0.45/1.02 Usable=23. Sos=11. Demods=0. Limbo=0, Disabled=20. Hints=0.
% 0.45/1.02 Megabytes=0.07.
% 0.45/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.02
% 0.45/1.02 ============================== end of statistics =====================
% 0.45/1.02
% 0.45/1.02 ============================== end of search =========================
% 0.45/1.02
% 0.45/1.02 THEOREM PROVED
% 0.45/1.02 % SZS status Theorem
% 0.45/1.02
% 0.45/1.02 Exiting with 1 proof.
% 0.45/1.02
% 0.45/1.02 Process 13835 exit (max_proofs) Sat Jun 18 02:22:10 2022
% 0.45/1.02 Prover9 interrupted
%------------------------------------------------------------------------------