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