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