TSTP Solution File: GEO025-2 by Otter---3.3

View Problem - Process Solution

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

% Computer : n015.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:10 EDT 2022

% Result   : Unsatisfiable 6.93s 7.09s
% Output   : Refutation 6.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   37 (  29 unt;   1 nHn;  26 RR)
%            Number of literals    :   54 (  10 equ;  19 neg)
%            Maximal clause size   :    8 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-5 aty)
%            Number of variables   :   60 (   7 sgn)

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

cnf(2,axiom,
    ( ~ e_quidistant(A,B,C,C)
    | A = B ),
    file('GEO025-2.p',unknown),
    [] ).

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

cnf(4,axiom,
    ( ~ between(A,B,A)
    | A = B ),
    file('GEO025-2.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ between(A,B,C)
    | ~ between(D,E,C)
    | between(B,inner_pasch(A,B,C,E,D),D) ),
    file('GEO025-2.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ between(A,B,C)
    | ~ between(D,E,C)
    | between(E,inner_pasch(A,B,C,E,D),A) ),
    file('GEO025-2.p',unknown),
    [] ).

cnf(16,axiom,
    ~ e_quidistant(u,w,u1,w1),
    file('GEO025-2.p',unknown),
    [] ).

cnf(36,axiom,
    e_quidistant(A,B,B,A),
    file('GEO025-2.p',unknown),
    [] ).

cnf(37,axiom,
    between(A,B,extension(A,B,C,D)),
    file('GEO025-2.p',unknown),
    [] ).

cnf(38,axiom,
    e_quidistant(A,extension(B,A,C,D),C,D),
    file('GEO025-2.p',unknown),
    [] ).

cnf(39,axiom,
    e_quidistant(u,v,u1,v1),
    file('GEO025-2.p',unknown),
    [] ).

cnf(40,axiom,
    e_quidistant(v,w,v1,w1),
    file('GEO025-2.p',unknown),
    [] ).

cnf(41,axiom,
    between(u,v,w),
    file('GEO025-2.p',unknown),
    [] ).

cnf(42,axiom,
    between(u1,v1,w1),
    file('GEO025-2.p',unknown),
    [] ).

cnf(167,plain,
    e_quidistant(u1,v1,v,u),
    inference(hyper,[status(thm)],[39,1,36]),
    [iquote('hyper,39,1,36')] ).

cnf(276,plain,
    e_quidistant(v1,w1,w,v),
    inference(hyper,[status(thm)],[40,1,36]),
    [iquote('hyper,40,1,36')] ).

cnf(417,plain,
    e_quidistant(v,u,v1,u1),
    inference(hyper,[status(thm)],[167,1,36]),
    [iquote('hyper,167,1,36')] ).

cnf(496,plain,
    extension(A,B,C,C) = B,
    inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[38,2])]),
    [iquote('hyper,38,2,flip.1')] ).

cnf(499,plain,
    e_quidistant(A,B,extension(C,D,A,B),D),
    inference(hyper,[status(thm)],[38,1,36]),
    [iquote('hyper,38,1,36')] ).

cnf(588,plain,
    e_quidistant(w,v,w1,v1),
    inference(hyper,[status(thm)],[276,1,36]),
    [iquote('hyper,276,1,36')] ).

cnf(1913,plain,
    ( A = B
    | ~ between(B,A,B) ),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[496,4]),496,496]),
    [iquote('para_into,495.1.1,4.2.1,demod,496,496')] ).

cnf(1915,plain,
    ( A = B
    | ~ e_quidistant(B,A,C,C) ),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[496,2]),496]),
    [iquote('para_into,495.1.1,2.2.1,demod,496')] ).

cnf(1916,plain,
    e_quidistant(A,A,B,B),
    inference(para_from,[status(thm),theory(equality)],[496,38]),
    [iquote('para_from,495.1.1,38.1.2')] ).

cnf(1917,plain,
    between(A,B,B),
    inference(para_from,[status(thm),theory(equality)],[496,37]),
    [iquote('para_from,495.1.1,37.1.3')] ).

cnf(1967,plain,
    between(v1,inner_pasch(A,w1,w1,v1,u1),A),
    inference(hyper,[status(thm)],[1917,6,42]),
    [iquote('hyper,1917,6,42')] ).

cnf(1968,plain,
    between(v,inner_pasch(A,w,w,v,u),A),
    inference(hyper,[status(thm)],[1917,6,41]),
    [iquote('hyper,1917,6,41')] ).

cnf(2379,plain,
    e_quidistant(v1,w1,extension(A,B,v,w),B),
    inference(hyper,[status(thm)],[499,1,40]),
    [iquote('hyper,499,1,40')] ).

cnf(2417,plain,
    inner_pasch(v1,w1,w1,v1,u1) = v1,
    inference(hyper,[status(thm)],[1967,1913]),
    [iquote('hyper,1967,1913')] ).

cnf(2419,plain,
    between(w1,v1,u1),
    inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[2417,5]),1917,42]),
    [iquote('para_from,2417.1.1,5.3.2,unit_del,1917,42')] ).

cnf(2441,plain,
    inner_pasch(v,w,w,v,u) = v,
    inference(hyper,[status(thm)],[1968,1913]),
    [iquote('hyper,1968,1913')] ).

cnf(2443,plain,
    between(w,v,u),
    inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[2441,5]),1917,41]),
    [iquote('para_from,2441.1.1,5.3.2,unit_del,1917,41')] ).

cnf(2455,plain,
    w = v,
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[2443,3,588,417,1916,40,2419]),16]),
    [iquote('hyper,2443,3,588,417,1916,40,2419,unit_del,16')] ).

cnf(2461,plain,
    e_quidistant(v1,w1,A,A),
    inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[2379]),2455,496]),
    [iquote('back_demod,2379,demod,2455,496')] ).

cnf(2515,plain,
    ~ e_quidistant(u,v,u1,w1),
    inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[16]),2455]),
    [iquote('back_demod,16,demod,2455')] ).

cnf(2529,plain,
    w1 = v1,
    inference(hyper,[status(thm)],[2461,1915]),
    [iquote('hyper,2461,1915')] ).

cnf(2534,plain,
    ~ e_quidistant(u,v,u1,v1),
    inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[2515]),2529]),
    [iquote('back_demod,2515,demod,2529')] ).

cnf(2535,plain,
    $false,
    inference(binary,[status(thm)],[2534,39]),
    [iquote('binary,2534.1,39.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : GEO025-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n015.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Wed Jul 27 07:31:56 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.94/2.13  ----- Otter 3.3f, August 2004 -----
% 1.94/2.13  The process was started by sandbox on n015.cluster.edu,
% 1.94/2.13  Wed Jul 27 07:31:57 2022
% 1.94/2.13  The command was "./otter".  The process ID is 28321.
% 1.94/2.13  
% 1.94/2.13  set(prolog_style_variables).
% 1.94/2.13  set(auto).
% 1.94/2.13     dependent: set(auto1).
% 1.94/2.13     dependent: set(process_input).
% 1.94/2.13     dependent: clear(print_kept).
% 1.94/2.13     dependent: clear(print_new_demod).
% 1.94/2.13     dependent: clear(print_back_demod).
% 1.94/2.13     dependent: clear(print_back_sub).
% 1.94/2.13     dependent: set(control_memory).
% 1.94/2.13     dependent: assign(max_mem, 12000).
% 1.94/2.13     dependent: assign(pick_given_ratio, 4).
% 1.94/2.13     dependent: assign(stats_level, 1).
% 1.94/2.13     dependent: assign(max_seconds, 10800).
% 1.94/2.13  clear(print_given).
% 1.94/2.13  
% 1.94/2.13  list(usable).
% 1.94/2.13  0 [] A=A.
% 1.94/2.13  0 [] e_quidistant(X,Y,Y,X).
% 1.94/2.13  0 [] -e_quidistant(X,Y,Z,V)| -e_quidistant(X,Y,V2,W)|e_quidistant(Z,V,V2,W).
% 1.94/2.13  0 [] -e_quidistant(X,Y,Z,Z)|X=Y.
% 1.94/2.13  0 [] between(X,Y,extension(X,Y,W,V)).
% 1.94/2.13  0 [] e_quidistant(Y,extension(X,Y,W,V),W,V).
% 1.94/2.13  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.94/2.13  0 [] -between(X,Y,X)|X=Y.
% 1.94/2.13  0 [] -between(U,V,W)| -between(Y,X,W)|between(V,inner_pasch(U,V,W,X,Y),Y).
% 1.94/2.13  0 [] -between(U,V,W)| -between(Y,X,W)|between(X,inner_pasch(U,V,W,X,Y),U).
% 1.94/2.13  0 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.94/2.13  0 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.94/2.13  0 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.94/2.13  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.94/2.13  0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,V,euclid1(U,V,W,X,Y)).
% 1.94/2.13  0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,X,euclid2(U,V,W,X,Y)).
% 1.94/2.13  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.94/2.13  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.94/2.13  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.94/2.13  0 [] e_quidistant(u,v,u1,v1).
% 1.94/2.13  0 [] e_quidistant(v,w,v1,w1).
% 1.94/2.13  0 [] between(u,v,w).
% 1.94/2.13  0 [] between(u1,v1,w1).
% 1.94/2.13  0 [] -e_quidistant(u,w,u1,w1).
% 1.94/2.13  end_of_list.
% 1.94/2.13  
% 1.94/2.13  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.94/2.13  
% 1.94/2.13  This ia a non-Horn set with equality.  The strategy will be
% 1.94/2.13  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.94/2.13  deletion, with positive clauses in sos and nonpositive
% 1.94/2.13  clauses in usable.
% 1.94/2.13  
% 1.94/2.13     dependent: set(knuth_bendix).
% 1.94/2.13     dependent: set(anl_eq).
% 1.94/2.13     dependent: set(para_from).
% 1.94/2.13     dependent: set(para_into).
% 1.94/2.13     dependent: clear(para_from_right).
% 1.94/2.13     dependent: clear(para_into_right).
% 1.94/2.13     dependent: set(para_from_vars).
% 1.94/2.13     dependent: set(eq_units_both_ways).
% 1.94/2.13     dependent: set(dynamic_demod_all).
% 1.94/2.13     dependent: set(dynamic_demod).
% 1.94/2.13     dependent: set(order_eq).
% 1.94/2.13     dependent: set(back_demod).
% 1.94/2.13     dependent: set(lrpo).
% 1.94/2.13     dependent: set(hyper_res).
% 1.94/2.13     dependent: set(unit_deletion).
% 1.94/2.13     dependent: set(factor).
% 1.94/2.13  
% 1.94/2.13  ------------> process usable:
% 1.94/2.13  ** KEPT (pick-wt=15): 1 [] -e_quidistant(A,B,C,D)| -e_quidistant(A,B,E,F)|e_quidistant(C,D,E,F).
% 1.94/2.13  ** KEPT (pick-wt=8): 2 [] -e_quidistant(A,B,C,C)|A=B.
% 1.94/2.13  ** 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.94/2.13  ** KEPT (pick-wt=7): 4 [] -between(A,B,A)|A=B.
% 1.94/2.13  ** KEPT (pick-wt=17): 5 [] -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 1.94/2.13  ** KEPT (pick-wt=17): 6 [] -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 1.94/2.13  ** KEPT (pick-wt=4): 7 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.94/2.13  ** KEPT (pick-wt=4): 8 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.94/2.13  ** KEPT (pick-wt=4): 9 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.94/2.13  ** 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.
% 6.93/7.09  ** KEPT (pick-wt=20): 11 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,D,euclid1(A,D,B,E,C)).
% 6.93/7.09  ** KEPT (pick-wt=20): 12 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,E,euclid2(A,D,B,E,C)).
% 6.93/7.09  ** 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)).
% 6.93/7.09  ** 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).
% 6.93/7.09  ** 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)).
% 6.93/7.09  ** KEPT (pick-wt=5): 16 [] -e_quidistant(u,w,u1,w1).
% 6.93/7.09  
% 6.93/7.09  ------------> process sos:
% 6.93/7.09  ** KEPT (pick-wt=3): 35 [] A=A.
% 6.93/7.09  ** KEPT (pick-wt=5): 36 [] e_quidistant(A,B,B,A).
% 6.93/7.09  ** KEPT (pick-wt=8): 37 [] between(A,B,extension(A,B,C,D)).
% 6.93/7.09  ** KEPT (pick-wt=9): 38 [] e_quidistant(A,extension(B,A,C,D),C,D).
% 6.93/7.09  ** KEPT (pick-wt=5): 39 [] e_quidistant(u,v,u1,v1).
% 6.93/7.09  ** KEPT (pick-wt=5): 40 [] e_quidistant(v,w,v1,w1).
% 6.93/7.09  ** KEPT (pick-wt=4): 41 [] between(u,v,w).
% 6.93/7.09  ** KEPT (pick-wt=4): 42 [] between(u1,v1,w1).
% 6.93/7.09    Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] A=A.
% 6.93/7.09  36 back subsumes 32.
% 6.93/7.09  
% 6.93/7.09  ======= end of input processing =======
% 6.93/7.09  
% 6.93/7.09  =========== start of search ===========
% 6.93/7.09  
% 6.93/7.09  
% 6.93/7.09  Resetting weight limit to 9.
% 6.93/7.09  
% 6.93/7.09  
% 6.93/7.09  Resetting weight limit to 9.
% 6.93/7.09  
% 6.93/7.09  sos_size=1862
% 6.93/7.09  
% 6.93/7.09  -------- PROOF -------- 
% 6.93/7.09  
% 6.93/7.09  ----> UNIT CONFLICT at   4.96 sec ----> 2535 [binary,2534.1,39.1] $F.
% 6.93/7.09  
% 6.93/7.09  Length of proof is 22.  Level of proof is 9.
% 6.93/7.09  
% 6.93/7.09  ---------------- PROOF ----------------
% 6.93/7.09  % SZS status Unsatisfiable
% 6.93/7.09  % SZS output start Refutation
% See solution above
% 6.93/7.09  ------------ end of proof -------------
% 6.93/7.09  
% 6.93/7.09  
% 6.93/7.09  Search stopped by max_proofs option.
% 6.93/7.09  
% 6.93/7.09  
% 6.93/7.09  Search stopped by max_proofs option.
% 6.93/7.09  
% 6.93/7.09  ============ end of search ============
% 6.93/7.09  
% 6.93/7.09  -------------- statistics -------------
% 6.93/7.09  clauses given                179
% 6.93/7.09  clauses generated          31162
% 6.93/7.09  clauses kept                2528
% 6.93/7.09  clauses forward subsumed    9814
% 6.93/7.09  clauses back subsumed        660
% 6.93/7.09  Kbytes malloced             5859
% 6.93/7.09  
% 6.93/7.09  ----------- times (seconds) -----------
% 6.93/7.09  user CPU time          4.96          (0 hr, 0 min, 4 sec)
% 6.93/7.09  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 6.93/7.09  wall-clock time        6             (0 hr, 0 min, 6 sec)
% 6.93/7.09  
% 6.93/7.09  That finishes the proof of the theorem.
% 6.93/7.09  
% 6.93/7.09  Process 28321 finished Wed Jul 27 07:32:03 2022
% 6.93/7.09  Otter interrupted
% 6.93/7.09  PROOF FOUND
%------------------------------------------------------------------------------