↑ Up

Otter---3.3.THM-Ref.s

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

% Computer : n012.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 13:17:44 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ( iext(uri_rdf_type,A,B)
    | ~ icext(B,A) ),
    file('SWB018+2.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ iext(uri_rdfs_domain,A,B)
    | ~ iext(A,C,D)
    | icext(B,C) ),
    file('SWB018+2.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ iext(uri_owl_sameAs,A,B)
    | A = B ),
    file('SWB018+2.p',unknown),
    [] ).

cnf(6,axiom,
    ~ iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
    file('SWB018+2.p',unknown),
    [] ).

cnf(8,axiom,
    iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person),
    file('SWB018+2.p',unknown),
    [] ).

cnf(9,axiom,
    iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
    file('SWB018+2.p',unknown),
    [] ).

cnf(15,plain,
    uri_ex_w = uri_ex_u,
    inference(hyper,[status(thm)],[9,4]),
    [iquote('hyper,9,4')] ).

cnf(16,plain,
    icext(uri_ex_Person,uri_ex_u),
    inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[9,3,8]),15]),
    [iquote('hyper,9,3,8,demod,15')] ).

cnf(18,plain,
    iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
    inference(hyper,[status(thm)],[16,2]),
    [iquote('hyper,16,2')] ).

cnf(19,plain,
    $false,
    inference(binary,[status(thm)],[18,6]),
    [iquote('binary,18.1,6.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWB018+2 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.13  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n012.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 02:29:50 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.77/1.92  ----- Otter 3.3f, August 2004 -----
% 1.77/1.92  The process was started by sandbox2 on n012.cluster.edu,
% 1.77/1.92  Wed Jul 27 02:29:51 2022
% 1.77/1.92  The command was "./otter".  The process ID is 22751.
% 1.77/1.92  
% 1.77/1.92  set(prolog_style_variables).
% 1.77/1.92  set(auto).
% 1.77/1.92     dependent: set(auto1).
% 1.77/1.92     dependent: set(process_input).
% 1.77/1.92     dependent: clear(print_kept).
% 1.77/1.92     dependent: clear(print_new_demod).
% 1.77/1.92     dependent: clear(print_back_demod).
% 1.77/1.92     dependent: clear(print_back_sub).
% 1.77/1.92     dependent: set(control_memory).
% 1.77/1.92     dependent: assign(max_mem, 12000).
% 1.77/1.92     dependent: assign(pick_given_ratio, 4).
% 1.77/1.92     dependent: assign(stats_level, 1).
% 1.77/1.92     dependent: assign(max_seconds, 10800).
% 1.77/1.92  clear(print_given).
% 1.77/1.92  
% 1.77/1.92  formula_list(usable).
% 1.77/1.92  all A (A=A).
% 1.77/1.92  all X C (iext(uri_rdf_type,X,C)<->icext(C,X)).
% 1.77/1.92  all P C X Y (iext(uri_rdfs_domain,P,C)&iext(P,X,Y)->icext(C,X)).
% 1.77/1.92  all X Y (iext(uri_owl_sameAs,X,Y)<->X=Y).
% 1.77/1.92  -iext(uri_rdf_type,uri_ex_u,uri_ex_Person).
% 1.77/1.92  iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person).
% 1.77/1.92  iext(uri_owl_sameAs,uri_ex_w,uri_ex_u).
% 1.77/1.92  end_of_list.
% 1.77/1.92  
% 1.77/1.92  -------> usable clausifies to:
% 1.77/1.92  
% 1.77/1.92  list(usable).
% 1.77/1.92  0 [] A=A.
% 1.77/1.92  0 [] -iext(uri_rdf_type,X,C)|icext(C,X).
% 1.77/1.92  0 [] iext(uri_rdf_type,X,C)| -icext(C,X).
% 1.77/1.92  0 [] -iext(uri_rdfs_domain,P,C)| -iext(P,X,Y)|icext(C,X).
% 1.77/1.92  0 [] -iext(uri_owl_sameAs,X,Y)|X=Y.
% 1.77/1.92  0 [] iext(uri_owl_sameAs,X,Y)|X!=Y.
% 1.77/1.92  0 [] -iext(uri_rdf_type,uri_ex_u,uri_ex_Person).
% 1.77/1.92  0 [] iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person).
% 1.77/1.92  0 [] iext(uri_owl_sameAs,uri_ex_w,uri_ex_u).
% 1.77/1.92  end_of_list.
% 1.77/1.92  
% 1.77/1.92  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.77/1.92  
% 1.77/1.92  This is a Horn set with equality.  The strategy will be
% 1.77/1.92  Knuth-Bendix and hyper_res, with positive clauses in
% 1.77/1.92  sos and nonpositive clauses in usable.
% 1.77/1.92  
% 1.77/1.92     dependent: set(knuth_bendix).
% 1.77/1.92     dependent: set(anl_eq).
% 1.77/1.92     dependent: set(para_from).
% 1.77/1.92     dependent: set(para_into).
% 1.77/1.92     dependent: clear(para_from_right).
% 1.77/1.92     dependent: clear(para_into_right).
% 1.77/1.92     dependent: set(para_from_vars).
% 1.77/1.92     dependent: set(eq_units_both_ways).
% 1.77/1.92     dependent: set(dynamic_demod_all).
% 1.77/1.92     dependent: set(dynamic_demod).
% 1.77/1.92     dependent: set(order_eq).
% 1.77/1.92     dependent: set(back_demod).
% 1.77/1.92     dependent: set(lrpo).
% 1.77/1.92     dependent: set(hyper_res).
% 1.77/1.92     dependent: clear(order_hyper).
% 1.77/1.92  
% 1.77/1.92  ------------> process usable:
% 1.77/1.92  ** KEPT (pick-wt=7): 1 [] -iext(uri_rdf_type,A,B)|icext(B,A).
% 1.77/1.92  ** KEPT (pick-wt=7): 2 [] iext(uri_rdf_type,A,B)| -icext(B,A).
% 1.77/1.92  ** KEPT (pick-wt=11): 3 [] -iext(uri_rdfs_domain,A,B)| -iext(A,C,D)|icext(B,C).
% 1.77/1.92  ** KEPT (pick-wt=7): 4 [] -iext(uri_owl_sameAs,A,B)|A=B.
% 1.77/1.92  ** KEPT (pick-wt=7): 5 [] iext(uri_owl_sameAs,A,B)|A!=B.
% 1.77/1.92  ** KEPT (pick-wt=4): 6 [] -iext(uri_rdf_type,uri_ex_u,uri_ex_Person).
% 1.77/1.92  
% 1.77/1.92  ------------> process sos:
% 1.77/1.92  ** KEPT (pick-wt=3): 7 [] A=A.
% 1.77/1.92  ** KEPT (pick-wt=4): 8 [] iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person).
% 1.77/1.92  ** KEPT (pick-wt=4): 9 [] iext(uri_owl_sameAs,uri_ex_w,uri_ex_u).
% 1.77/1.92    Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] A=A.
% 1.77/1.92  
% 1.77/1.92  ======= end of input processing =======
% 1.77/1.92  
% 1.77/1.92  =========== start of search ===========
% 1.77/1.92  
% 1.77/1.92  -------- PROOF -------- 
% 1.77/1.92  
% 1.77/1.92  ----> UNIT CONFLICT at   0.00 sec ----> 19 [binary,18.1,6.1] $F.
% 1.77/1.92  
% 1.77/1.92  Length of proof is 3.  Level of proof is 3.
% 1.77/1.92  
% 1.77/1.92  ---------------- PROOF ----------------
% 1.77/1.92  % SZS status Theorem
% 1.77/1.92  % SZS output start Refutation
% See solution above
% 1.77/1.92  ------------ end of proof -------------
% 1.77/1.92  
% 1.77/1.92  
% 1.77/1.92  Search stopped by max_proofs option.
% 1.77/1.92  
% 1.77/1.92  
% 1.77/1.92  Search stopped by max_proofs option.
% 1.77/1.92  
% 1.77/1.92  ============ end of search ============
% 1.77/1.92  
% 1.77/1.92  -------------- statistics -------------
% 1.77/1.92  clauses given                  5
% 1.77/1.92  clauses generated             11
% 1.77/1.92  clauses kept                  17
% 1.77/1.92  clauses forward subsumed       5
% 1.77/1.92  clauses back subsumed          0
% 1.77/1.92  Kbytes malloced              976
% 1.77/1.92  
% 1.77/1.92  ----------- times (seconds) -----------
% 1.77/1.92  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.77/1.92  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.77/1.92  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.77/1.92  
% 1.77/1.92  That finishes the proof of the theorem.
% 1.77/1.92  
% 1.77/1.92  Process 22751 finished Wed Jul 27 02:29:52 2022
% 1.77/1.92  Otter interrupted
% 1.77/1.92  PROOF FOUND
%------------------------------------------------------------------------------