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