↑ Up

Otter---3.3.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : GEO179+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n004.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:38 EDT 2022

% Result   : Theorem 1.77s 1.96s
% Output   : Refutation 1.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   22 (   7 unt;  12 nHn;  12 RR)
%            Number of literals    :   42 (   0 equ;  10 neg)
%            Maximal clause size   :    3 (   1 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   :   23 (   0 sgn)

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

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

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

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

cnf(12,axiom,
    ( ~ apart_point_and_line(A,B)
    | distinct_points(A,C)
    | apart_point_and_line(C,B) ),
    file('GEO179+1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ apart_point_and_line(A,B)
    | distinct_lines(B,C)
    | apart_point_and_line(A,C) ),
    file('GEO179+1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ distinct_lines(line_connecting(dollar_c3,dollar_c2),line_connecting(dollar_c1,dollar_c3))
    | ~ distinct_lines(line_connecting(dollar_c3,dollar_c2),line_connecting(dollar_c1,dollar_c2)) ),
    file('GEO179+1.p',unknown),
    [] ).

cnf(16,axiom,
    distinct_points(dollar_c3,dollar_c2),
    file('GEO179+1.p',unknown),
    [] ).

cnf(17,axiom,
    apart_point_and_line(dollar_c1,line_connecting(dollar_c3,dollar_c2)),
    file('GEO179+1.p',unknown),
    [] ).

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

cnf(19,plain,
    ( distinct_lines(line_connecting(dollar_c3,dollar_c2),A)
    | apart_point_and_line(dollar_c1,A) ),
    inference(hyper,[status(thm)],[17,13]),
    [iquote('hyper,17,13')] ).

cnf(20,plain,
    ( distinct_points(dollar_c1,A)
    | apart_point_and_line(A,line_connecting(dollar_c3,dollar_c2)) ),
    inference(hyper,[status(thm)],[17,12]),
    [iquote('hyper,17,12')] ).

cnf(21,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(24,plain,
    ( apart_point_and_line(dollar_c1,line_connecting(dollar_c1,dollar_c2))
    | apart_point_and_line(dollar_c1,line_connecting(dollar_c1,dollar_c3)) ),
    inference(hyper,[status(thm)],[19,15,19]),
    [iquote('hyper,19,15,19')] ).

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

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

cnf(48,plain,
    ( apart_point_and_line(dollar_c1,line_connecting(dollar_c1,dollar_c3))
    | apart_point_and_line(dollar_c2,line_connecting(dollar_c3,dollar_c2)) ),
    inference(hyper,[status(thm)],[24,7,20]),
    [iquote('hyper,24,7,20')] ).

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

cnf(122,plain,
    apart_point_and_line(dollar_c1,line_connecting(dollar_c1,dollar_c3)),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[48,8,59]),1]),
    [iquote('hyper,48,8,59,unit_del,1')] ).

cnf(128,plain,
    apart_point_and_line(dollar_c3,line_connecting(dollar_c3,dollar_c2)),
    inference(hyper,[status(thm)],[122,7,20]),
    [iquote('hyper,122,7,20')] ).

cnf(131,plain,
    distinct_points(dollar_c3,dollar_c3),
    inference(hyper,[status(thm)],[128,7,59]),
    [iquote('hyper,128,7,59')] ).

cnf(132,plain,
    $false,
    inference(binary,[status(thm)],[131,1]),
    [iquote('binary,131.1,1.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : GEO179+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.14  % Command  : otter-tptp-script %s
% 0.14/0.35  % Computer : n004.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Wed Jul 27 06:52:36 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 1.77/1.95  ----- Otter 3.3f, August 2004 -----
% 1.77/1.95  The process was started by sandbox on n004.cluster.edu,
% 1.77/1.95  Wed Jul 27 06:52:36 2022
% 1.77/1.95  The command was "./otter".  The process ID is 11739.
% 1.77/1.95  
% 1.77/1.95  set(prolog_style_variables).
% 1.77/1.95  set(auto).
% 1.77/1.95     dependent: set(auto1).
% 1.77/1.95     dependent: set(process_input).
% 1.77/1.95     dependent: clear(print_kept).
% 1.77/1.95     dependent: clear(print_new_demod).
% 1.77/1.95     dependent: clear(print_back_demod).
% 1.77/1.95     dependent: clear(print_back_sub).
% 1.77/1.95     dependent: set(control_memory).
% 1.77/1.95     dependent: assign(max_mem, 12000).
% 1.77/1.95     dependent: assign(pick_given_ratio, 4).
% 1.77/1.95     dependent: assign(stats_level, 1).
% 1.77/1.95     dependent: assign(max_seconds, 10800).
% 1.77/1.95  clear(print_given).
% 1.77/1.95  
% 1.77/1.95  formula_list(usable).
% 1.77/1.95  all X (-distinct_points(X,X)).
% 1.77/1.95  all X (-distinct_lines(X,X)).
% 1.77/1.95  all X (-convergent_lines(X,X)).
% 1.77/1.95  all X Y Z (distinct_points(X,Y)->distinct_points(X,Z)|distinct_points(Y,Z)).
% 1.77/1.95  all X Y Z (distinct_lines(X,Y)->distinct_lines(X,Z)|distinct_lines(Y,Z)).
% 1.77/1.95  all X Y Z (convergent_lines(X,Y)->convergent_lines(X,Z)|convergent_lines(Y,Z)).
% 1.77/1.95  all X Y (distinct_points(X,Y)-> -apart_point_and_line(X,line_connecting(X,Y))).
% 1.77/1.95  all X Y (distinct_points(X,Y)-> -apart_point_and_line(Y,line_connecting(X,Y))).
% 1.77/1.95  all X Y (convergent_lines(X,Y)-> -apart_point_and_line(intersection_point(X,Y),X)).
% 1.77/1.95  all X Y (convergent_lines(X,Y)-> -apart_point_and_line(intersection_point(X,Y),Y)).
% 1.77/1.95  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.77/1.95  all X Y Z (apart_point_and_line(X,Y)->distinct_points(X,Z)|apart_point_and_line(Z,Y)).
% 1.77/1.95  all X Y Z (apart_point_and_line(X,Y)->distinct_lines(Y,Z)|apart_point_and_line(X,Z)).
% 1.77/1.95  all X Y Z (convergent_lines(X,Y)->distinct_lines(Y,Z)|convergent_lines(X,Z)).
% 1.77/1.95  -(all X Y Z (distinct_points(X,Y)&apart_point_and_line(Z,line_connecting(X,Y))->distinct_lines(line_connecting(X,Y),line_connecting(Z,X))&distinct_lines(line_connecting(X,Y),line_connecting(Z,Y)))).
% 1.77/1.95  end_of_list.
% 1.77/1.95  
% 1.77/1.95  -------> usable clausifies to:
% 1.77/1.95  
% 1.77/1.95  list(usable).
% 1.77/1.95  0 [] -distinct_points(X,X).
% 1.77/1.95  0 [] -distinct_lines(X,X).
% 1.77/1.95  0 [] -convergent_lines(X,X).
% 1.77/1.95  0 [] -distinct_points(X,Y)|distinct_points(X,Z)|distinct_points(Y,Z).
% 1.77/1.95  0 [] -distinct_lines(X,Y)|distinct_lines(X,Z)|distinct_lines(Y,Z).
% 1.77/1.95  0 [] -convergent_lines(X,Y)|convergent_lines(X,Z)|convergent_lines(Y,Z).
% 1.77/1.95  0 [] -distinct_points(X,Y)| -apart_point_and_line(X,line_connecting(X,Y)).
% 1.77/1.95  0 [] -distinct_points(X,Y)| -apart_point_and_line(Y,line_connecting(X,Y)).
% 1.77/1.95  0 [] -convergent_lines(X,Y)| -apart_point_and_line(intersection_point(X,Y),X).
% 1.77/1.95  0 [] -convergent_lines(X,Y)| -apart_point_and_line(intersection_point(X,Y),Y).
% 1.77/1.95  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.77/1.95  0 [] -apart_point_and_line(X,Y)|distinct_points(X,Z)|apart_point_and_line(Z,Y).
% 1.77/1.95  0 [] -apart_point_and_line(X,Y)|distinct_lines(Y,Z)|apart_point_and_line(X,Z).
% 1.77/1.95  0 [] -convergent_lines(X,Y)|distinct_lines(Y,Z)|convergent_lines(X,Z).
% 1.77/1.95  0 [] distinct_points($c3,$c2).
% 1.77/1.95  0 [] apart_point_and_line($c1,line_connecting($c3,$c2)).
% 1.77/1.95  0 [] -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c3))| -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c2)).
% 1.77/1.95  end_of_list.
% 1.77/1.95  
% 1.77/1.95  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.77/1.95  
% 1.77/1.95  This is a non-Horn set without equality.  The strategy will
% 1.77/1.95  be ordered hyper_res, unit deletion, and factoring, with
% 1.77/1.95  satellites in sos and with nuclei in usable.
% 1.77/1.95  
% 1.77/1.95     dependent: set(hyper_res).
% 1.77/1.95     dependent: set(factor).
% 1.77/1.95     dependent: set(unit_deletion).
% 1.77/1.95  
% 1.77/1.95  ------------> process usable:
% 1.77/1.95  ** KEPT (pick-wt=3): 1 [] -distinct_points(A,A).
% 1.77/1.95  ** KEPT (pick-wt=3): 2 [] -distinct_lines(A,A).
% 1.77/1.95  ** KEPT (pick-wt=3): 3 [] -convergent_lines(A,A).
% 1.77/1.95  ** KEPT (pick-wt=9): 4 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 1.77/1.95  ** KEPT (pick-wt=9): 5 [] -distinct_lines(A,B)|distinct_lines(A,C)|distinct_lines(B,C).
% 1.77/1.95  ** KEPT (pick-wt=9): 6 [] -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.77/1.95  ** KEPT (pick-wt=8): 7 [] -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 1.77/1.95  ** KEPT (pick-wt=8): 8 [] -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 1.77/1.96  ** KEPT (pick-wt=8): 9 [] -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),A).
% 1.77/1.96  ** KEPT (pick-wt=8): 10 [] -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 1.77/1.96  ** 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).
% 1.77/1.96  ** KEPT (pick-wt=9): 12 [] -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 1.77/1.96  ** KEPT (pick-wt=9): 13 [] -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 1.77/1.96  ** KEPT (pick-wt=9): 14 [] -convergent_lines(A,B)|distinct_lines(B,C)|convergent_lines(A,C).
% 1.77/1.96  ** KEPT (pick-wt=14): 15 [] -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c3))| -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c2)).
% 1.77/1.96  
% 1.77/1.96  ------------> process sos:
% 1.77/1.96  ** KEPT (pick-wt=3): 16 [] distinct_points($c3,$c2).
% 1.77/1.96  ** KEPT (pick-wt=5): 17 [] apart_point_and_line($c1,line_connecting($c3,$c2)).
% 1.77/1.96  
% 1.77/1.96  ======= end of input processing =======
% 1.77/1.96  
% 1.77/1.96  =========== start of search ===========
% 1.77/1.96  
% 1.77/1.96  -------- PROOF -------- 
% 1.77/1.96  
% 1.77/1.96  ----> UNIT CONFLICT at   0.01 sec ----> 132 [binary,131.1,1.1] $F.
% 1.77/1.96  
% 1.77/1.96  Length of proof is 12.  Level of proof is 8.
% 1.77/1.96  
% 1.77/1.96  ---------------- PROOF ----------------
% 1.77/1.96  % SZS status Theorem
% 1.77/1.96  % SZS output start Refutation
% See solution above
% 1.77/1.96  ------------ end of proof -------------
% 1.77/1.96  
% 1.77/1.96  
% 1.77/1.96  Search stopped by max_proofs option.
% 1.77/1.96  
% 1.77/1.96  
% 1.77/1.96  Search stopped by max_proofs option.
% 1.77/1.96  
% 1.77/1.96  ============ end of search ============
% 1.77/1.96  
% 1.77/1.96  -------------- statistics -------------
% 1.77/1.96  clauses given                 25
% 1.77/1.96  clauses generated            508
% 1.77/1.96  clauses kept                 131
% 1.77/1.96  clauses forward subsumed     394
% 1.77/1.96  clauses back subsumed         74
% 1.77/1.96  Kbytes malloced              976
% 1.77/1.96  
% 1.77/1.96  ----------- times (seconds) -----------
% 1.77/1.96  user CPU time          0.01          (0 hr, 0 min, 0 sec)
% 1.77/1.96  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.77/1.96  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.77/1.96  
% 1.77/1.96  That finishes the proof of the theorem.
% 1.77/1.96  
% 1.77/1.96  Process 11739 finished Wed Jul 27 06:52:38 2022
% 1.77/1.96  Otter interrupted
% 1.77/1.96  PROOF FOUND
%------------------------------------------------------------------------------