TSTP Solution File: GEO227+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO227+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:19 EDT 2022
% Result : Theorem 0.84s 1.10s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO227+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 18:46:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.09 ============================== Prover9 ===============================
% 0.44/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.09 Process 14533 was started by sandbox on n013.cluster.edu,
% 0.44/1.09 Sat Jun 18 18:46:59 2022
% 0.44/1.09 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14377_n013.cluster.edu".
% 0.44/1.09 ============================== end of head ===========================
% 0.44/1.09
% 0.44/1.09 ============================== INPUT =================================
% 0.44/1.09
% 0.44/1.09 % Reading from file /tmp/Prover9_14377_n013.cluster.edu
% 0.44/1.09
% 0.44/1.09 set(prolog_style_variables).
% 0.44/1.09 set(auto2).
% 0.44/1.09 % set(auto2) -> set(auto).
% 0.44/1.09 % set(auto) -> set(auto_inference).
% 0.44/1.09 % set(auto) -> set(auto_setup).
% 0.44/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.09 % set(auto) -> set(auto_limits).
% 0.44/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.09 % set(auto) -> set(auto_denials).
% 0.44/1.09 % set(auto) -> set(auto_process).
% 0.44/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.09 % set(auto2) -> assign(stats, some).
% 0.44/1.09 % set(auto2) -> clear(echo_input).
% 0.44/1.09 % set(auto2) -> set(quiet).
% 0.44/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.09 % set(auto2) -> clear(print_given).
% 0.44/1.09 assign(lrs_ticks,-1).
% 0.44/1.09 assign(sos_limit,10000).
% 0.44/1.09 assign(order,kbo).
% 0.44/1.09 set(lex_order_vars).
% 0.44/1.09 clear(print_given).
% 0.44/1.09
% 0.44/1.09 % formulas(sos). % not echoed (32 formulas)
% 0.44/1.09
% 0.44/1.09 ============================== end of input ==========================
% 0.44/1.09
% 0.44/1.09 % From the command line: assign(max_seconds, 300).
% 0.44/1.09
% 0.44/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.09
% 0.44/1.09 % Formulas that are not ordinary clauses:
% 0.44/1.09 1 (all A all L (apart_point_and_line(A,L) <-> left_apart_point(A,L) | left_apart_point(A,reverse_line(L)))) # label(apt_def) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.09 2 (all L all M (convergent_lines(L,M) <-> unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)))) # label(con_def) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.09 3 (all A all B all L (divides_points(L,A,B) <-> left_apart_point(A,L) & left_apart_point(B,reverse_line(L)) | left_apart_point(A,reverse_line(L)) & left_apart_point(B,L))) # label(div_def) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.09 4 (all L all A all B (before_on_line(L,A,B) <-> distinct_points(A,B) & -(left_apart_point(A,L) | left_apart_point(A,reverse_line(L))) & -(left_apart_point(B,L) | left_apart_point(B,reverse_line(L))) & -unequally_directed_lines(L,line_connecting(A,B)))) # label(bf_def) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.09 5 (all L all A all B all C (between_on_line(L,A,B,C) <-> before_on_line(L,A,B) & before_on_line(L,B,C) | before_on_line(L,C,B) & before_on_line(L,B,A))) # label(bet_def) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.09 6 (all A -distinct_points(A,A)) # label(oag1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.09 7 (all A all B all C (distinct_points(A,B) -> distinct_points(A,C) | distinct_points(B,C))) # label(oag2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.09 8 (all L -distinct_lines(L,L)) # label(oag3) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.09 9 (all L all M all N (distinct_lines(L,M) -> distinct_lines(L,N) | distinct_lines(M,N))) # label(oag4) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.09 10 (all L -unequally_directed_lines(L,L)) # label(oag5) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.09 11 (all L all M all N (unequally_directed_lines(L,M) -> unequally_directed_lines(L,N) | unequally_directed_lines(M,N))) # label(oag6) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.09 12 (all L all M all N (unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) -> unequally_directed_lines(L,N) & unequally_directed_lines(L,reverse_line(N)) | unequally_directed_lines(M,N) & unequally_directed_lines(M,reverse_line(N)))) # label(oag7) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 13 (all L all M (line(L) & line(M) -> unequally_directed_lines(L,M) | unequally_directed_lines(L,reverse_line(M)))) # label(oag8) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 14 (all L all M (unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) -> left_convergent_lines(L,M) | left_convergent_lines(L,reverse_line(M)))) # label(oag9) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 15 (all A all L -(left_apart_point(A,L) | left_apart_point(A,reverse_line(L)))) # label(oag10) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 16 (all L all M -(left_convergent_lines(L,M) | left_convergent_lines(L,reverse_line(M)))) # label(oag11) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 17 (all A all B (point(A) & point(B) & distinct_points(A,B) -> line(line_connecting(A,B)))) # label(oagco1) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 18 (all L all M (line(L) & line(M) & unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) -> point(intersection_point(L,M)))) # label(oagco2) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 19 (all L all A (point(A) & line(L) -> line(parallel_through_point(L,A)))) # label(oagco3) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 20 (all L (line(L) -> line(reverse_line(L)))) # label(oagco4) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 21 (all A all B (distinct_points(A,B) -> -apart_point_and_line(A,line_connecting(A,B)) & -apart_point_and_line(B,line_connecting(A,B)))) # label(oagco5) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 22 (all L all M (unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) -> -apart_point_and_line(intersection_point(L,M),L) & -apart_point_and_line(intersection_point(L,M),M))) # label(oagco6) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 23 (all A all L -apart_point_and_line(A,parallel_through_point(L,A))) # label(oagco7) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 24 (all L -distinct_lines(L,reverse_line(L))) # label(oagco8) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 25 (all A all B -unequally_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A)))) # label(oagco9) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 26 (all A all L -unequally_directed_lines(parallel_through_point(L,A),L)) # label(oagco10) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 27 (all A all B all L all M (distinct_points(A,B) & distinct_lines(L,M) -> left_apart_point(A,L) | left_apart_point(B,L) | left_apart_point(A,M) | left_apart_point(B,M) | left_apart_point(A,reverse_line(L)) | left_apart_point(B,reverse_line(L)) | left_apart_point(A,reverse_line(M)) | left_apart_point(B,reverse_line(M)))) # label(oaguc1) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 28 (all A all B all L (distinct_points(A,B) & left_apart_point(A,L) -> left_apart_point(B,L) | left_convergent_lines(line_connecting(A,B),L))) # label(oaguc2) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 29 (all A all B all L (left_apart_point(A,L) -> distinct_points(A,B) | left_apart_point(B,L))) # label(oagsub1) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 30 (all A all L all M (left_apart_point(A,L) & unequally_directed_lines(L,M) -> distinct_lines(L,M) | left_apart_point(A,reverse_line(M)))) # label(oagsub2) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 31 (all L all M all N (left_convergent_lines(L,M) -> unequally_directed_lines(M,N) | left_convergent_lines(L,N))) # label(oagsub3) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 32 -(all L all M (line(L) & line(M) -> -(-unequally_directed_lines(L,M) & -unequally_directed_lines(L,reverse_line(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 33 apart_point_and_line(A,B) | -left_apart_point(A,B) # label(apt_def) # label(axiom). [clausify(1)].
% 0.84/1.09 34 -apart_point_and_line(A,parallel_through_point(B,A)) # label(oagco7) # label(axiom). [clausify(23)].
% 0.84/1.09 35 -distinct_points(A,B) | -apart_point_and_line(A,line_connecting(A,B)) # label(oagco5) # label(axiom). [clausify(21)].
% 0.84/1.09 36 -distinct_points(A,B) | -apart_point_and_line(B,line_connecting(A,B)) # label(oagco5) # label(axiom). [clausify(21)].
% 0.84/1.09 37 -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)) | -apart_point_and_line(intersection_point(A,B),A) # label(oagco6) # label(axiom). [clausify(22)].
% 0.84/1.09 38 -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)) | -apart_point_and_line(intersection_point(A,B),B) # label(oagco6) # label(axiom). [clausify(22)].
% 0.84/1.09 Derived: -left_apart_point(A,parallel_through_point(B,A)). [resolve(33,a,34,a)].
% 0.84/1.09 Derived: -left_apart_point(A,line_connecting(A,B)) | -distinct_points(A,B). [resolve(33,a,35,b)].
% 0.84/1.09 Derived: -left_apart_point(A,line_connecting(B,A)) | -distinct_points(B,A). [resolve(33,a,36,b)].
% 0.84/1.09 Derived: -left_apart_point(intersection_point(A,B),A) | -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)). [resolve(33,a,37,c)].
% 0.84/1.09 Derived: -left_apart_point(intersection_point(A,B),B) | -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)). [resolve(33,a,38,c)].
% 0.84/1.09 39 apart_point_and_line(A,B) | -left_apart_point(A,reverse_line(B)) # label(apt_def) # label(axiom). [clausify(1)].
% 0.84/1.09 Derived: -left_apart_point(A,reverse_line(parallel_through_point(B,A))). [resolve(39,a,34,a)].
% 0.84/1.09 Derived: -left_apart_point(A,reverse_line(line_connecting(A,B))) | -distinct_points(A,B). [resolve(39,a,35,b)].
% 0.84/1.09 Derived: -left_apart_point(A,reverse_line(line_connecting(B,A))) | -distinct_points(B,A). [resolve(39,a,36,b)].
% 0.84/1.09 Derived: -left_apart_point(intersection_point(A,B),reverse_line(A)) | -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)). [resolve(39,a,37,c)].
% 0.84/1.09 Derived: -left_apart_point(intersection_point(A,B),reverse_line(B)) | -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)). [resolve(39,a,38,c)].
% 0.84/1.09 40 -apart_point_and_line(A,B) | left_apart_point(A,B) | left_apart_point(A,reverse_line(B)) # label(apt_def) # label(axiom). [clausify(1)].
% 0.84/1.09 41 convergent_lines(A,B) | -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)) # label(con_def) # label(axiom). [clausify(2)].
% 0.84/1.09 42 -convergent_lines(A,B) | unequally_directed_lines(A,B) # label(con_def) # label(axiom). [clausify(2)].
% 0.84/1.09 43 -convergent_lines(A,B) | unequally_directed_lines(A,reverse_line(B)) # label(con_def) # label(axiom). [clausify(2)].
% 0.84/1.09 44 divides_points(A,B,C) | -left_apart_point(B,A) | -left_apart_point(C,reverse_line(A)) # label(div_def) # label(axiom). [clausify(3)].
% 0.84/1.09 45 -divides_points(A,B,C) | left_apart_point(B,A) | left_apart_point(C,A) # label(div_def) # label(axiom). [clausify(3)].
% 0.84/1.09 46 -divides_points(A,B,C) | left_apart_point(B,A) | left_apart_point(B,reverse_line(A)) # label(div_def) # label(axiom). [clausify(3)].
% 0.84/1.09 47 -divides_points(A,B,C) | left_apart_point(C,reverse_line(A)) | left_apart_point(C,A) # label(div_def) # label(axiom). [clausify(3)].
% 0.84/1.09 48 divides_points(A,B,C) | -left_apart_point(B,reverse_line(A)) | -left_apart_point(C,A) # label(div_def) # label(axiom). [clausify(3)].
% 0.84/1.09 49 -divides_points(A,B,C) | left_apart_point(C,reverse_line(A)) | left_apart_point(B,reverse_line(A)) # label(div_def) # label(axiom). [clausify(3)].
% 0.84/1.09 50 between_on_line(A,B,C,D) | -before_on_line(A,B,C) | -before_on_line(A,C,D) # label(bet_def) # label(axiom). [clausify(5)].
% 0.84/1.09 51 -between_on_line(A,B,C,D) | before_on_line(A,B,C) | before_on_line(A,D,C) # label(bet_def) # label(axiom). [clausify(5)].
% 0.84/1.09 52 -between_on_line(A,B,C,D) | before_on_line(A,B,C) | before_on_line(A,C,B) # label(bet_def) # label(axiom). [clausify(5)].
% 0.84/1.09 53 -between_on_line(A,B,C,D) | before_on_line(A,C,D) | before_on_line(A,D,C) # label(bet_def) # label(axiom). [clausify(5)].
% 0.84/1.10 54 -between_on_line(A,B,C,D) | before_on_line(A,C,D) | before_on_line(A,C,B) # label(bet_def) # label(axiom). [clausify(5)].
% 0.84/1.10 55 between_on_line(A,B,C,D) | -before_on_line(A,D,C) | -before_on_line(A,C,B) # label(bet_def) # label(axiom). [clausify(5)].
% 0.84/1.10 56 before_on_line(A,B,C) | -distinct_points(B,C) | left_apart_point(B,A) | left_apart_point(B,reverse_line(A)) | left_apart_point(C,A) | left_apart_point(C,reverse_line(A)) | unequally_directed_lines(A,line_connecting(B,C)) # label(bf_def) # label(axiom). [clausify(4)].
% 0.84/1.10 57 -before_on_line(A,B,C) | -left_apart_point(B,A) # label(bf_def) # label(axiom). [clausify(4)].
% 0.84/1.10 58 -before_on_line(A,B,C) | -left_apart_point(C,A) # label(bf_def) # label(axiom). [clausify(4)].
% 0.84/1.10 59 -before_on_line(A,B,C) | -left_apart_point(B,reverse_line(A)) # label(bf_def) # label(axiom). [clausify(4)].
% 0.84/1.10 60 -before_on_line(A,B,C) | -left_apart_point(C,reverse_line(A)) # label(bf_def) # label(axiom). [clausify(4)].
% 0.84/1.10 61 -before_on_line(A,B,C) | -unequally_directed_lines(A,line_connecting(B,C)) # label(bf_def) # label(axiom). [clausify(4)].
% 0.84/1.10 62 -before_on_line(A,B,C) | distinct_points(B,C) # label(bf_def) # label(axiom). [clausify(4)].
% 0.84/1.10
% 0.84/1.10 ============================== end predicate elimination =============
% 0.84/1.10
% 0.84/1.10 Auto_denials: (non-Horn, no changes).
% 0.84/1.10
% 0.84/1.10 Term ordering decisions:
% 0.84/1.10
% 0.84/1.10 % Assigning unary symbol reverse_line kb_weight 0 and highest precedence (13).
% 0.84/1.10 Function symbol KB weights: c1=1. c2=1. line_connecting=1. intersection_point=1. parallel_through_point=1. reverse_line=0.
% 0.84/1.10
% 0.84/1.10 ============================== end of process initial clauses ========
% 0.84/1.10
% 0.84/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.84/1.10
% 0.84/1.10 ============================== end of clauses for search =============
% 0.84/1.10
% 0.84/1.10 ============================== SEARCH ================================
% 0.84/1.10
% 0.84/1.10 % Starting search at 0.02 seconds.
% 0.84/1.10
% 0.84/1.10 ============================== PROOF =================================
% 0.84/1.10 % SZS status Theorem
% 0.84/1.10 % SZS output start Refutation
% 0.84/1.10
% 0.84/1.10 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.84/1.10 % Length of proof is 8.
% 0.84/1.10 % Level of proof is 2.
% 0.84/1.10 % Maximum clause weight is 11.000.
% 0.84/1.10 % Given clauses 18.
% 0.84/1.10
% 0.84/1.10 13 (all L all M (line(L) & line(M) -> unequally_directed_lines(L,M) | unequally_directed_lines(L,reverse_line(M)))) # label(oag8) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 32 -(all L all M (line(L) & line(M) -> -(-unequally_directed_lines(L,M) & -unequally_directed_lines(L,reverse_line(M))))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.84/1.10 63 line(c1) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.84/1.10 64 line(c2) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.84/1.10 70 -unequally_directed_lines(c1,c2) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.84/1.10 72 -unequally_directed_lines(c1,reverse_line(c2)) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.84/1.10 82 -line(A) | -line(B) | unequally_directed_lines(A,B) | unequally_directed_lines(A,reverse_line(B)) # label(oag8) # label(axiom). [clausify(13)].
% 0.84/1.10 111 $F. [ur(82,b,64,a,c,70,a,d,72,a),unit_del(a,63)].
% 0.84/1.10
% 0.84/1.10 % SZS output end Refutation
% 0.84/1.10 ============================== end of proof ==========================
% 0.84/1.10
% 0.84/1.10 ============================== STATISTICS ============================
% 0.84/1.10
% 0.84/1.10 Given=18. Generated=78. Kept=42. proofs=1.
% 0.84/1.10 Usable=18. Sos=18. Demods=0. Limbo=4, Disabled=74. Hints=0.
% 0.84/1.10 Megabytes=0.11.
% 0.84/1.10 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.84/1.10
% 0.84/1.10 ============================== end of statistics =====================
% 0.84/1.10
% 0.84/1.10 ============================== end of search =========================
% 0.84/1.10
% 0.84/1.10 THEOREM PROVED
% 0.84/1.10 % SZS status Theorem
% 0.84/1.10
% 0.84/1.10 Exiting with 1 proof.
% 0.84/1.10
% 0.84/1.10 Process 14533 exit (max_proofs) Sat Jun 18 18:46:59 2022
% 0.84/1.10 Prover9 interrupted
%------------------------------------------------------------------------------