↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : GEO057-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n006.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:16 EDT 2022

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

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

cnf(16,axiom,
    u != reflection(u,u),
    file('GEO057-2.p',unknown),
    [] ).

cnf(17,plain,
    reflection(u,u) != u,
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[16])]),
    [iquote('copy,16,flip.1')] ).

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

cnf(41,axiom,
    reflection(A,B) = extension(A,B,A,B),
    file('GEO057-2.p',unknown),
    [] ).

cnf(42,plain,
    extension(u,u,u,u) != u,
    inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[17]),41]),
    [iquote('back_demod,17,demod,41')] ).

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

cnf(155,plain,
    $false,
    inference(binary,[status(thm)],[153,42]),
    [iquote('binary,153.1,42.1')] ).

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