TSTP Solution File: GEO022-3 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : GEO022-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n027.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:09 EDT 2022

% Result   : Unsatisfiable 1.82s 2.00s
% Output   : Refutation 1.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    8 (   6 unt;   0 nHn;   8 RR)
%            Number of literals    :   11 (   0 equ;   4 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   10 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ e_quidistant(A,B,C,D)
    | ~ e_quidistant(A,B,E,F)
    | e_quidistant(C,D,E,F) ),
    file('GEO022-3.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ e_quidistant(A,B,C,D)
    | e_quidistant(C,D,A,B) ),
    file('GEO022-3.p',unknown),
    [] ).

cnf(23,axiom,
    ~ e_quidistant(u,v,y,z),
    file('GEO022-3.p',unknown),
    [] ).

cnf(45,axiom,
    e_quidistant(u,v,w,x),
    file('GEO022-3.p',unknown),
    [] ).

cnf(46,axiom,
    e_quidistant(w,x,y,z),
    file('GEO022-3.p',unknown),
    [] ).

cnf(53,plain,
    e_quidistant(w,x,u,v),
    inference(hyper,[status(thm)],[45,16]),
    [iquote('hyper,45,16')] ).

cnf(603,plain,
    e_quidistant(u,v,y,z),
    inference(hyper,[status(thm)],[53,1,46]),
    [iquote('hyper,53,1,46')] ).

cnf(604,plain,
    $false,
    inference(binary,[status(thm)],[603,23]),
    [iquote('binary,603.1,23.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : GEO022-3 : TPTP v8.1.0. Released v1.0.0.
% 0.09/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n027.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:32:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.63/1.84  ----- Otter 3.3f, August 2004 -----
% 1.63/1.84  The process was started by sandbox2 on n027.cluster.edu,
% 1.63/1.84  Wed Jul 27 07:32:06 2022
% 1.63/1.84  The command was "./otter".  The process ID is 3970.
% 1.63/1.84  
% 1.63/1.84  set(prolog_style_variables).
% 1.63/1.84  set(auto).
% 1.63/1.84     dependent: set(auto1).
% 1.63/1.84     dependent: set(process_input).
% 1.63/1.84     dependent: clear(print_kept).
% 1.63/1.84     dependent: clear(print_new_demod).
% 1.63/1.84     dependent: clear(print_back_demod).
% 1.63/1.84     dependent: clear(print_back_sub).
% 1.63/1.84     dependent: set(control_memory).
% 1.63/1.84     dependent: assign(max_mem, 12000).
% 1.63/1.84     dependent: assign(pick_given_ratio, 4).
% 1.63/1.84     dependent: assign(stats_level, 1).
% 1.63/1.84     dependent: assign(max_seconds, 10800).
% 1.63/1.84  clear(print_given).
% 1.63/1.84  
% 1.63/1.84  list(usable).
% 1.63/1.84  0 [] A=A.
% 1.63/1.84  0 [] e_quidistant(X,Y,Y,X).
% 1.63/1.84  0 [] -e_quidistant(X,Y,Z,V)| -e_quidistant(X,Y,V2,W)|e_quidistant(Z,V,V2,W).
% 1.63/1.84  0 [] -e_quidistant(X,Y,Z,Z)|X=Y.
% 1.63/1.84  0 [] between(X,Y,extension(X,Y,W,V)).
% 1.63/1.84  0 [] e_quidistant(Y,extension(X,Y,W,V),W,V).
% 1.63/1.84  0 [] -e_quidistant(X,Y,X1,Y1)| -e_quidistant(Y,Z,Y1,Z1)| -e_quidistant(X,V,X1,V1)| -e_quidistant(Y,V,Y1,V1)| -between(X,Y,Z)| -between(X1,Y1,Z1)|X=Y|e_quidistant(Z,V,Z1,V1).
% 1.63/1.84  0 [] -between(X,Y,X)|X=Y.
% 1.63/1.84  0 [] -between(U,V,W)| -between(Y,X,W)|between(V,inner_pasch(U,V,W,X,Y),Y).
% 1.63/1.84  0 [] -between(U,V,W)| -between(Y,X,W)|between(X,inner_pasch(U,V,W,X,Y),U).
% 1.63/1.84  0 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.63/1.84  0 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.63/1.84  0 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.63/1.84  0 [] -e_quidistant(X,W,X,V)| -e_quidistant(Y,W,Y,V)| -e_quidistant(Z,W,Z,V)|between(X,Y,Z)|between(Y,Z,X)|between(Z,X,Y)|W=V.
% 1.63/1.84  0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,V,euclid1(U,V,W,X,Y)).
% 1.63/1.84  0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,X,euclid2(U,V,W,X,Y)).
% 1.63/1.84  0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(euclid1(U,V,W,X,Y),Y,euclid2(U,V,W,X,Y)).
% 1.63/1.84  0 [] -e_quidistant(U,V,U,V1)| -e_quidistant(U,X,U,X1)| -between(U,V,X)| -between(V,W,X)|between(V1,continuous(U,V,V1,W,X,X1),X1).
% 1.63/1.84  0 [] -e_quidistant(U,V,U,V1)| -e_quidistant(U,X,U,X1)| -between(U,V,X)| -between(V,W,X)|e_quidistant(U,W,U,continuous(U,V,V1,W,X,X1)).
% 1.63/1.84  0 [] e_quidistant(U,V,U,V).
% 1.63/1.84  0 [] -e_quidistant(U,V,W,X)|e_quidistant(W,X,U,V).
% 1.63/1.84  0 [] -e_quidistant(U,V,W,X)|e_quidistant(V,U,W,X).
% 1.63/1.84  0 [] -e_quidistant(U,V,W,X)|e_quidistant(U,V,X,W).
% 1.63/1.84  0 [] -e_quidistant(U,V,W,X)|e_quidistant(V,U,X,W).
% 1.63/1.84  0 [] -e_quidistant(U,V,W,X)|e_quidistant(W,X,V,U).
% 1.63/1.84  0 [] -e_quidistant(U,V,W,X)|e_quidistant(X,W,U,V).
% 1.63/1.84  0 [] -e_quidistant(U,V,W,X)|e_quidistant(X,W,V,U).
% 1.63/1.84  0 [] e_quidistant(u,v,w,x).
% 1.63/1.84  0 [] e_quidistant(w,x,y,z).
% 1.63/1.84  0 [] -e_quidistant(u,v,y,z).
% 1.63/1.84  end_of_list.
% 1.63/1.84  
% 1.63/1.84  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.63/1.84  
% 1.63/1.84  This ia a non-Horn set with equality.  The strategy will be
% 1.63/1.84  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.63/1.84  deletion, with positive clauses in sos and nonpositive
% 1.63/1.84  clauses in usable.
% 1.63/1.84  
% 1.63/1.84     dependent: set(knuth_bendix).
% 1.63/1.84     dependent: set(anl_eq).
% 1.63/1.84     dependent: set(para_from).
% 1.63/1.84     dependent: set(para_into).
% 1.63/1.84     dependent: clear(para_from_right).
% 1.63/1.84     dependent: clear(para_into_right).
% 1.63/1.84     dependent: set(para_from_vars).
% 1.63/1.84     dependent: set(eq_units_both_ways).
% 1.63/1.84     dependent: set(dynamic_demod_all).
% 1.63/1.84     dependent: set(dynamic_demod).
% 1.63/1.84     dependent: set(order_eq).
% 1.63/1.84     dependent: set(back_demod).
% 1.63/1.84     dependent: set(lrpo).
% 1.63/1.84     dependent: set(hyper_res).
% 1.63/1.84     dependent: set(unit_deletion).
% 1.63/1.84     dependent: set(factor).
% 1.63/1.84  
% 1.63/1.84  ------------> process usable:
% 1.63/1.84  ** KEPT (pick-wt=15): 1 [] -e_quidistant(A,B,C,D)| -e_quidistant(A,B,E,F)|e_quidistant(C,D,E,F).
% 1.63/1.84  ** KEPT (pick-wt=8): 2 [] -e_quidistant(A,B,C,C)|A=B.
% 1.63/1.84  ** KEPT (pick-wt=36): 3 [] -e_quidistant(A,B,C,D)| -e_quidistant(B,E,D,F)| -e_quidistant(A,G,C,H)| -e_quidistant(B,G,D,H)| -between(A,B,E)| -between(C,D,F)|A=B|e_quidistant(E,G,F,H).
% 1.63/1.84  ** KEPT (pick-wt=7): 4 [] -between(A,B,A)|A=B.
% 1.63/1.84  ** KEPT (pick-wt=17): 5 [] -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 1.63/1.84  ** KEPT (pick-wt=17): 6 [] -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 1.63/1.84  ** KEPT (pick-wt=4): 7 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.82/2.00  ** KEPT (pick-wt=4): 8 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.82/2.00  ** KEPT (pick-wt=4): 9 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.82/2.00  ** KEPT (pick-wt=30): 10 [] -e_quidistant(A,B,A,C)| -e_quidistant(D,B,D,C)| -e_quidistant(E,B,E,C)|between(A,D,E)|between(D,E,A)|between(E,A,D)|B=C.
% 1.82/2.00  ** KEPT (pick-wt=20): 11 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,D,euclid1(A,D,B,E,C)).
% 1.82/2.00  ** KEPT (pick-wt=20): 12 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,E,euclid2(A,D,B,E,C)).
% 1.82/2.00  ** KEPT (pick-wt=25): 13 [] -between(A,B,C)| -between(D,B,E)|A=B|between(euclid1(A,D,B,E,C),C,euclid2(A,D,B,E,C)).
% 1.82/2.00  ** KEPT (pick-wt=28): 14 [] -e_quidistant(A,B,A,C)| -e_quidistant(A,D,A,E)| -between(A,B,D)| -between(B,F,D)|between(C,continuous(A,B,C,F,D,E),E).
% 1.82/2.00  ** KEPT (pick-wt=29): 15 [] -e_quidistant(A,B,A,C)| -e_quidistant(A,D,A,E)| -between(A,B,D)| -between(B,F,D)|e_quidistant(A,F,A,continuous(A,B,C,F,D,E)).
% 1.82/2.00  ** KEPT (pick-wt=10): 16 [] -e_quidistant(A,B,C,D)|e_quidistant(C,D,A,B).
% 1.82/2.00  ** KEPT (pick-wt=10): 17 [] -e_quidistant(A,B,C,D)|e_quidistant(B,A,C,D).
% 1.82/2.00  ** KEPT (pick-wt=10): 18 [] -e_quidistant(A,B,C,D)|e_quidistant(A,B,D,C).
% 1.82/2.00  ** KEPT (pick-wt=10): 19 [] -e_quidistant(A,B,C,D)|e_quidistant(B,A,D,C).
% 1.82/2.00  ** KEPT (pick-wt=10): 20 [] -e_quidistant(A,B,C,D)|e_quidistant(C,D,B,A).
% 1.82/2.00  ** KEPT (pick-wt=10): 21 [] -e_quidistant(A,B,C,D)|e_quidistant(D,C,A,B).
% 1.82/2.00  ** KEPT (pick-wt=10): 22 [] -e_quidistant(A,B,C,D)|e_quidistant(D,C,B,A).
% 1.82/2.00  ** KEPT (pick-wt=5): 23 [] -e_quidistant(u,v,y,z).
% 1.82/2.00  
% 1.82/2.00  ------------> process sos:
% 1.82/2.00  ** KEPT (pick-wt=3): 40 [] A=A.
% 1.82/2.00  ** KEPT (pick-wt=5): 41 [] e_quidistant(A,B,B,A).
% 1.82/2.00  ** KEPT (pick-wt=8): 42 [] between(A,B,extension(A,B,C,D)).
% 1.82/2.00  ** KEPT (pick-wt=9): 43 [] e_quidistant(A,extension(B,A,C,D),C,D).
% 1.82/2.00  ** KEPT (pick-wt=5): 44 [] e_quidistant(A,B,A,B).
% 1.82/2.00  ** KEPT (pick-wt=5): 45 [] e_quidistant(u,v,w,x).
% 1.82/2.00  ** KEPT (pick-wt=5): 46 [] e_quidistant(w,x,y,z).
% 1.82/2.00    Following clause subsumed by 40 during input processing: 0 [copy,40,flip.1] A=A.
% 1.82/2.00  41 back subsumes 37.
% 1.82/2.00  44 back subsumes 24.
% 1.82/2.00  
% 1.82/2.00  ======= end of input processing =======
% 1.82/2.00  
% 1.82/2.00  =========== start of search ===========
% 1.82/2.00  
% 1.82/2.00  -------- PROOF -------- 
% 1.82/2.00  
% 1.82/2.00  ----> UNIT CONFLICT at   0.17 sec ----> 604 [binary,603.1,23.1] $F.
% 1.82/2.00  
% 1.82/2.00  Length of proof is 2.  Level of proof is 2.
% 1.82/2.00  
% 1.82/2.00  ---------------- PROOF ----------------
% 1.82/2.00  % SZS status Unsatisfiable
% 1.82/2.00  % SZS output start Refutation
% See solution above
% 1.82/2.00  ------------ end of proof -------------
% 1.82/2.00  
% 1.82/2.00  
% 1.82/2.00  Search stopped by max_proofs option.
% 1.82/2.00  
% 1.82/2.00  
% 1.82/2.00  Search stopped by max_proofs option.
% 1.82/2.00  
% 1.82/2.00  ============ end of search ============
% 1.82/2.00  
% 1.82/2.00  -------------- statistics -------------
% 1.82/2.00  clauses given                 14
% 1.82/2.00  clauses generated           1834
% 1.82/2.00  clauses kept                 602
% 1.82/2.00  clauses forward subsumed    1120
% 1.82/2.00  clauses back subsumed          5
% 1.82/2.00  Kbytes malloced             1953
% 1.82/2.00  
% 1.82/2.00  ----------- times (seconds) -----------
% 1.82/2.00  user CPU time          0.17          (0 hr, 0 min, 0 sec)
% 1.82/2.00  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.82/2.00  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.82/2.00  
% 1.82/2.00  That finishes the proof of the theorem.
% 1.82/2.00  
% 1.82/2.00  Process 3970 finished Wed Jul 27 07:32:08 2022
% 1.82/2.00  Otter interrupted
% 1.82/2.00  PROOF FOUND
%------------------------------------------------------------------------------