TSTP Solution File: GEO204+2 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : GEO204+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %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  : 300s
% DateTime : Wed Jul 27 12:54:48 EDT 2022

% Result   : Theorem 7.37s 7.59s
% Output   : Refutation 7.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   27 (   9 unt;  15 nHn;  16 RR)
%            Number of literals    :   63 (   0 equ;  10 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ distinct_points(A,A),
    file('GEO204+2.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ distinct_points(A,B)
    | distinct_points(A,C)
    | distinct_points(B,C) ),
    file('GEO204+2.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ distinct_points(A,B)
    | ~ apart_point_and_line(C,line_connecting(A,B))
    | distinct_points(C,A) ),
    file('GEO204+2.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ distinct_points(A,B)
    | ~ apart_point_and_line(C,line_connecting(A,B))
    | distinct_points(C,B) ),
    file('GEO204+2.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ 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) ),
    file('GEO204+2.p',unknown),
    [] ).

cnf(15,axiom,
    ~ distinct_points(dollar_c2,dollar_c1),
    file('GEO204+2.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ distinct_points(dollar_c3,dollar_c1)
    | distinct_lines(line_connecting(dollar_c3,dollar_c2),line_connecting(dollar_c3,dollar_c1)) ),
    file('GEO204+2.p',unknown),
    [] ).

cnf(17,axiom,
    distinct_points(dollar_c3,dollar_c2),
    file('GEO204+2.p',unknown),
    [] ).

cnf(18,plain,
    ( distinct_points(dollar_c3,A)
    | distinct_points(dollar_c2,A) ),
    inference(hyper,[status(thm)],[17,4]),
    [iquote('hyper,17,4')] ).

cnf(19,plain,
    distinct_lines(line_connecting(dollar_c3,dollar_c2),line_connecting(dollar_c3,dollar_c1)),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[18,16]),15]),
    [iquote('hyper,18,16,unit_del,15')] ).

cnf(20,plain,
    ( distinct_points(dollar_c2,A)
    | distinct_points(dollar_c3,B)
    | distinct_points(A,B) ),
    inference(hyper,[status(thm)],[18,4]),
    [iquote('hyper,18,4')] ).

cnf(22,plain,
    distinct_points(dollar_c3,dollar_c1),
    inference(hyper,[status(thm)],[18,15]),
    [iquote('hyper,18,15')] ).

cnf(30,plain,
    ( apart_point_and_line(dollar_c3,line_connecting(dollar_c3,dollar_c2))
    | apart_point_and_line(dollar_c3,line_connecting(dollar_c3,dollar_c1))
    | apart_point_and_line(dollar_c1,line_connecting(dollar_c3,dollar_c2))
    | apart_point_and_line(dollar_c1,line_connecting(dollar_c3,dollar_c1)) ),
    inference(hyper,[status(thm)],[19,11,22]),
    [iquote('hyper,19,11,22')] ).

cnf(39,plain,
    ( distinct_points(dollar_c2,A)
    | distinct_points(A,dollar_c3) ),
    inference(hyper,[status(thm)],[20,1]),
    [iquote('hyper,20,1')] ).

cnf(44,plain,
    ( distinct_points(A,dollar_c3)
    | distinct_points(dollar_c2,B)
    | distinct_points(A,B) ),
    inference(hyper,[status(thm)],[39,4]),
    [iquote('hyper,39,4')] ).

cnf(67,plain,
    ( distinct_points(A,dollar_c3)
    | distinct_points(A,B)
    | distinct_points(dollar_c2,C)
    | distinct_points(B,C) ),
    inference(hyper,[status(thm)],[44,4]),
    [iquote('hyper,44,4')] ).

cnf(68,plain,
    ( distinct_points(A,dollar_c3)
    | distinct_points(A,dollar_c2) ),
    inference(hyper,[status(thm)],[44,1]),
    [iquote('hyper,44,1')] ).

cnf(148,plain,
    ( apart_point_and_line(dollar_c3,line_connecting(dollar_c3,dollar_c1))
    | apart_point_and_line(dollar_c1,line_connecting(dollar_c3,dollar_c2))
    | apart_point_and_line(dollar_c1,line_connecting(dollar_c3,dollar_c1)) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[30,7,68]),1,1]),
    [iquote('hyper,30,7,68,unit_del,1,1')] ).

cnf(282,plain,
    ( distinct_points(A,dollar_c3)
    | distinct_points(A,B)
    | distinct_points(B,dollar_c1) ),
    inference(hyper,[status(thm)],[67,15]),
    [iquote('hyper,67,15')] ).

cnf(287,plain,
    ( distinct_points(A,dollar_c3)
    | distinct_points(A,B)
    | distinct_points(B,dollar_c2) ),
    inference(hyper,[status(thm)],[67,1]),
    [iquote('hyper,67,1')] ).

cnf(299,plain,
    ( distinct_points(A,dollar_c3)
    | distinct_points(B,dollar_c2)
    | distinct_points(A,C)
    | distinct_points(B,C) ),
    inference(hyper,[status(thm)],[287,4]),
    [iquote('hyper,287,4')] ).

cnf(1502,plain,
    ( apart_point_and_line(dollar_c1,line_connecting(dollar_c3,dollar_c2))
    | apart_point_and_line(dollar_c1,line_connecting(dollar_c3,dollar_c1)) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[148,7,282]),1,1,1]),
    [iquote('hyper,148,7,282,unit_del,1,1,1')] ).

cnf(1528,plain,
    apart_point_and_line(dollar_c1,line_connecting(dollar_c3,dollar_c2)),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[1502,8,282]),1,1,1]),
    [iquote('hyper,1502,8,282,unit_del,1,1,1')] ).

cnf(1532,plain,
    distinct_points(dollar_c1,dollar_c2),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[1528,8,299]),1])])]),
    [iquote('hyper,1528,8,299,unit_del,1,factor_simp,factor_simp')] ).

cnf(1541,plain,
    ( distinct_points(dollar_c1,A)
    | distinct_points(dollar_c2,A) ),
    inference(hyper,[status(thm)],[1532,4]),
    [iquote('hyper,1532,4')] ).

cnf(1548,plain,
    distinct_points(dollar_c2,dollar_c1),
    inference(hyper,[status(thm)],[1541,1]),
    [iquote('hyper,1541,1')] ).

cnf(1549,plain,
    $false,
    inference(binary,[status(thm)],[1548,15]),
    [iquote('binary,1548.1,15.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GEO204+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n026.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  : 300
% 0.12/0.33  % DateTime : Wed Jul 27 07:23:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.96/2.15  ----- Otter 3.3f, August 2004 -----
% 1.96/2.15  The process was started by sandbox2 on n026.cluster.edu,
% 1.96/2.15  Wed Jul 27 07:23:39 2022
% 1.96/2.15  The command was "./otter".  The process ID is 11101.
% 1.96/2.15  
% 1.96/2.15  set(prolog_style_variables).
% 1.96/2.15  set(auto).
% 1.96/2.15     dependent: set(auto1).
% 1.96/2.15     dependent: set(process_input).
% 1.96/2.15     dependent: clear(print_kept).
% 1.96/2.15     dependent: clear(print_new_demod).
% 1.96/2.15     dependent: clear(print_back_demod).
% 1.96/2.15     dependent: clear(print_back_sub).
% 1.96/2.15     dependent: set(control_memory).
% 1.96/2.15     dependent: assign(max_mem, 12000).
% 1.96/2.15     dependent: assign(pick_given_ratio, 4).
% 1.96/2.15     dependent: assign(stats_level, 1).
% 1.96/2.15     dependent: assign(max_seconds, 10800).
% 1.96/2.15  clear(print_given).
% 1.96/2.15  
% 1.96/2.15  formula_list(usable).
% 1.96/2.15  all X (-distinct_points(X,X)).
% 1.96/2.15  all X (-distinct_lines(X,X)).
% 1.96/2.15  all X (-convergent_lines(X,X)).
% 1.96/2.15  all X Y Z (distinct_points(X,Y)->distinct_points(X,Z)|distinct_points(Y,Z)).
% 1.96/2.15  all X Y Z (distinct_lines(X,Y)->distinct_lines(X,Z)|distinct_lines(Y,Z)).
% 1.96/2.15  all X Y Z (convergent_lines(X,Y)->convergent_lines(X,Z)|convergent_lines(Y,Z)).
% 1.96/2.15  all X Y Z (distinct_points(X,Y)-> (apart_point_and_line(Z,line_connecting(X,Y))->distinct_points(Z,X)&distinct_points(Z,Y))).
% 1.96/2.15  all X Y Z (convergent_lines(X,Y)-> (apart_point_and_line(Z,X)|apart_point_and_line(Z,Y)->distinct_points(Z,intersection_point(X,Y)))).
% 1.96/2.15  all X Y U 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)).
% 1.96/2.15  all X Y Z (apart_point_and_line(X,Y)->distinct_points(X,Z)|apart_point_and_line(Z,Y)).
% 1.96/2.15  all X Y Z (apart_point_and_line(X,Y)->distinct_lines(Y,Z)|apart_point_and_line(X,Z)).
% 1.96/2.15  all X Y (convergent_lines(X,Y)->distinct_lines(X,Y)).
% 1.96/2.15  -(all X Y Z (distinct_points(X,Y)& -distinct_points(Y,Z)->distinct_points(X,Z)& -distinct_lines(line_connecting(X,Y),line_connecting(X,Z)))).
% 1.96/2.15  end_of_list.
% 1.96/2.15  
% 1.96/2.15  -------> usable clausifies to:
% 1.96/2.15  
% 1.96/2.15  list(usable).
% 1.96/2.15  0 [] -distinct_points(X,X).
% 1.96/2.15  0 [] -distinct_lines(X,X).
% 1.96/2.15  0 [] -convergent_lines(X,X).
% 1.96/2.15  0 [] -distinct_points(X,Y)|distinct_points(X,Z)|distinct_points(Y,Z).
% 1.96/2.15  0 [] -distinct_lines(X,Y)|distinct_lines(X,Z)|distinct_lines(Y,Z).
% 1.96/2.15  0 [] -convergent_lines(X,Y)|convergent_lines(X,Z)|convergent_lines(Y,Z).
% 1.96/2.15  0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,X).
% 1.96/2.15  0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,Y).
% 1.96/2.15  0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,X)|distinct_points(Z,intersection_point(X,Y)).
% 1.96/2.15  0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,Y)|distinct_points(Z,intersection_point(X,Y)).
% 1.96/2.15  0 [] -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).
% 1.96/2.15  0 [] -apart_point_and_line(X,Y)|distinct_points(X,Z)|apart_point_and_line(Z,Y).
% 1.96/2.15  0 [] -apart_point_and_line(X,Y)|distinct_lines(Y,Z)|apart_point_and_line(X,Z).
% 1.96/2.15  0 [] -convergent_lines(X,Y)|distinct_lines(X,Y).
% 1.96/2.15  0 [] distinct_points($c3,$c2).
% 1.96/2.15  0 [] -distinct_points($c2,$c1).
% 1.96/2.15  0 [] -distinct_points($c3,$c1)|distinct_lines(line_connecting($c3,$c2),line_connecting($c3,$c1)).
% 1.96/2.15  end_of_list.
% 1.96/2.15  
% 1.96/2.15  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.96/2.15  
% 1.96/2.15  This is a non-Horn set without equality.  The strategy will
% 1.96/2.15  be ordered hyper_res, unit deletion, and factoring, with
% 1.96/2.15  satellites in sos and with nuclei in usable.
% 1.96/2.15  
% 1.96/2.15     dependent: set(hyper_res).
% 1.96/2.15     dependent: set(factor).
% 1.96/2.15     dependent: set(unit_deletion).
% 1.96/2.15  
% 1.96/2.15  ------------> process usable:
% 1.96/2.15  ** KEPT (pick-wt=3): 1 [] -distinct_points(A,A).
% 1.96/2.15  ** KEPT (pick-wt=3): 2 [] -distinct_lines(A,A).
% 1.96/2.15  ** KEPT (pick-wt=3): 3 [] -convergent_lines(A,A).
% 1.96/2.15  ** KEPT (pick-wt=9): 4 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 1.96/2.15  ** KEPT (pick-wt=9): 5 [] -distinct_lines(A,B)|distinct_lines(A,C)|distinct_lines(B,C).
% 1.96/2.15  ** KEPT (pick-wt=9): 6 [] -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.96/2.15  ** KEPT (pick-wt=11): 7 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,A).
% 1.96/2.15  ** KEPT (pick-wt=11): 8 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,B).
% 1.96/2.15  ** KEPT (pick-wt=11): 9 [] -convergent_lines(A,B)| -apart_point_and_line(C,A)|distinct_points(C,intersection_point(A,B)).
% 7.37/7.59  ** KEPT (pick-wt=11): 10 [] -convergent_lines(A,B)| -apart_point_and_line(C,B)|distinct_points(C,intersection_point(A,B)).
% 7.37/7.59  ** KEPT (pick-wt=18): 11 [] -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).
% 7.37/7.59  ** KEPT (pick-wt=9): 12 [] -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 7.37/7.59  ** KEPT (pick-wt=9): 13 [] -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 7.37/7.59  ** KEPT (pick-wt=6): 14 [] -convergent_lines(A,B)|distinct_lines(A,B).
% 7.37/7.59  ** KEPT (pick-wt=3): 15 [] -distinct_points($c2,$c1).
% 7.37/7.59  ** KEPT (pick-wt=10): 16 [] -distinct_points($c3,$c1)|distinct_lines(line_connecting($c3,$c2),line_connecting($c3,$c1)).
% 7.37/7.59  
% 7.37/7.59  ------------> process sos:
% 7.37/7.59  ** KEPT (pick-wt=3): 17 [] distinct_points($c3,$c2).
% 7.37/7.59  
% 7.37/7.59  ======= end of input processing =======
% 7.37/7.59  
% 7.37/7.59  =========== start of search ===========
% 7.37/7.59  
% 7.37/7.59  -------- PROOF -------- 
% 7.37/7.59  
% 7.37/7.59  ----> UNIT CONFLICT at   5.44 sec ----> 1549 [binary,1548.1,15.1] $F.
% 7.37/7.59  
% 7.37/7.59  Length of proof is 18.  Level of proof is 11.
% 7.37/7.59  
% 7.37/7.59  ---------------- PROOF ----------------
% 7.37/7.59  % SZS status Theorem
% 7.37/7.59  % SZS output start Refutation
% See solution above
% 7.37/7.59  ------------ end of proof -------------
% 7.37/7.59  
% 7.37/7.59  
% 7.37/7.59  Search stopped by max_proofs option.
% 7.37/7.59  
% 7.37/7.59  
% 7.37/7.59  Search stopped by max_proofs option.
% 7.37/7.59  
% 7.37/7.59  ============ end of search ============
% 7.37/7.59  
% 7.37/7.59  -------------- statistics -------------
% 7.37/7.59  clauses given                 78
% 7.37/7.59  clauses generated          18520
% 7.37/7.59  clauses kept                1548
% 7.37/7.59  clauses forward subsumed   16989
% 7.37/7.59  clauses back subsumed        234
% 7.37/7.59  Kbytes malloced             1953
% 7.37/7.59  
% 7.37/7.59  ----------- times (seconds) -----------
% 7.37/7.59  user CPU time          5.44          (0 hr, 0 min, 5 sec)
% 7.37/7.59  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 7.37/7.59  wall-clock time        7             (0 hr, 0 min, 7 sec)
% 7.37/7.59  
% 7.37/7.59  That finishes the proof of the theorem.
% 7.37/7.59  
% 7.37/7.59  Process 11101 finished Wed Jul 27 07:23:46 2022
% 7.37/7.59  Otter interrupted
% 7.37/7.59  PROOF FOUND
%------------------------------------------------------------------------------