TSTP Solution File: SWB023+2 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SWB023+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n007.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:47 EDT 2022

% Result   : Theorem 1.58s 1.80s
% Output   : Refutation 1.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   20 (  15 unt;   0 nHn;  18 RR)
%            Number of literals    :   30 (   6 equ;  13 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;  12 con; 0-0 aty)
%            Number of variables   :   14 (   0 sgn)

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

cnf(4,axiom,
    ( ~ iext(uri_rdf_first,A,B)
    | ~ iext(uri_rdf_rest,A,uri_rdf_nil)
    | ~ iext(uri_owl_oneOf,C,A)
    | ~ icext(C,D)
    | D = B ),
    file('SWB023+2.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ icext(uri_owl_FunctionalProperty,A)
    | ~ iext(A,B,C)
    | ~ iext(A,B,D)
    | C = D ),
    file('SWB023+2.p',unknown),
    [] ).

cnf(14,axiom,
    ( iext(uri_owl_sameAs,A,B)
    | A != B ),
    file('SWB023+2.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)
    | ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_v) ),
    file('SWB023+2.p',unknown),
    [] ).

cnf(17,axiom,
    A = A,
    file('SWB023+2.p',unknown),
    [] ).

cnf(18,axiom,
    iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty),
    file('SWB023+2.p',unknown),
    [] ).

cnf(19,axiom,
    iext(uri_rdf_type,uri_ex_w,dollar_c2),
    file('SWB023+2.p',unknown),
    [] ).

cnf(21,axiom,
    iext(uri_owl_oneOf,dollar_c2,dollar_c1),
    file('SWB023+2.p',unknown),
    [] ).

cnf(22,axiom,
    iext(uri_rdf_first,dollar_c1,uri_ex_u),
    file('SWB023+2.p',unknown),
    [] ).

cnf(23,axiom,
    iext(uri_rdf_first,dollar_c1,uri_ex_v),
    file('SWB023+2.p',unknown),
    [] ).

cnf(24,axiom,
    iext(uri_rdf_rest,dollar_c1,uri_rdf_nil),
    file('SWB023+2.p',unknown),
    [] ).

cnf(25,plain,
    iext(uri_owl_sameAs,A,A),
    inference(hyper,[status(thm)],[17,14]),
    [iquote('hyper,17,14')] ).

cnf(26,plain,
    icext(uri_owl_FunctionalProperty,uri_rdf_first),
    inference(hyper,[status(thm)],[18,1]),
    [iquote('hyper,18,1')] ).

cnf(46,plain,
    icext(dollar_c2,uri_ex_w),
    inference(hyper,[status(thm)],[19,1]),
    [iquote('hyper,19,1')] ).

cnf(97,plain,
    uri_ex_v = uri_ex_u,
    inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[23,9,26,22])]),
    [iquote('hyper,23,9,26,22,flip.1')] ).

cnf(98,plain,
    ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
    inference(factor_simp,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[15]),97])]),
    [iquote('back_demod,15,demod,97,factor_simp')] ).

cnf(103,plain,
    uri_ex_w = uri_ex_u,
    inference(hyper,[status(thm)],[24,4,22,21,46]),
    [iquote('hyper,24,4,22,21,46')] ).

cnf(105,plain,
    ~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_u),
    inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[98]),103]),
    [iquote('back_demod,98,demod,103')] ).

cnf(106,plain,
    $false,
    inference(binary,[status(thm)],[105,25]),
    [iquote('binary,105.1,25.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWB023+2 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n007.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 02:14:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.58/1.80  ----- Otter 3.3f, August 2004 -----
% 1.58/1.80  The process was started by sandbox2 on n007.cluster.edu,
% 1.58/1.80  Wed Jul 27 02:14:46 2022
% 1.58/1.80  The command was "./otter".  The process ID is 3112.
% 1.58/1.80  
% 1.58/1.80  set(prolog_style_variables).
% 1.58/1.80  set(auto).
% 1.58/1.80     dependent: set(auto1).
% 1.58/1.80     dependent: set(process_input).
% 1.58/1.80     dependent: clear(print_kept).
% 1.58/1.80     dependent: clear(print_new_demod).
% 1.58/1.80     dependent: clear(print_back_demod).
% 1.58/1.80     dependent: clear(print_back_sub).
% 1.58/1.80     dependent: set(control_memory).
% 1.58/1.80     dependent: assign(max_mem, 12000).
% 1.58/1.80     dependent: assign(pick_given_ratio, 4).
% 1.58/1.80     dependent: assign(stats_level, 1).
% 1.58/1.80     dependent: assign(max_seconds, 10800).
% 1.58/1.80  clear(print_given).
% 1.58/1.80  
% 1.58/1.80  formula_list(usable).
% 1.58/1.80  all A (A=A).
% 1.58/1.80  all X C (iext(uri_rdf_type,X,C)<->icext(C,X)).
% 1.58/1.80  all Z S1 A1 (iext(uri_rdf_first,S1,A1)&iext(uri_rdf_rest,S1,uri_rdf_nil)-> (iext(uri_owl_oneOf,Z,S1)<->ic(Z)& (all X (icext(Z,X)<->X=A1)))).
% 1.58/1.80  all P (icext(uri_owl_FunctionalProperty,P)<->ip(P)& (all X Y1 Y2 (iext(P,X,Y1)&iext(P,X,Y2)->Y1=Y2))).
% 1.58/1.80  all X Y (iext(uri_owl_sameAs,X,Y)<->X=Y).
% 1.58/1.80  -(iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)&iext(uri_owl_sameAs,uri_ex_w,uri_ex_v)).
% 1.58/1.80  exists BNODE_o BNODE_l (iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty)&iext(uri_rdf_type,uri_ex_w,BNODE_o)&iext(uri_rdf_type,BNODE_o,uri_owl_Class)&iext(uri_owl_oneOf,BNODE_o,BNODE_l)&iext(uri_rdf_first,BNODE_l,uri_ex_u)&iext(uri_rdf_first,BNODE_l,uri_ex_v)&iext(uri_rdf_rest,BNODE_l,uri_rdf_nil)).
% 1.58/1.80  end_of_list.
% 1.58/1.80  
% 1.58/1.80  -------> usable clausifies to:
% 1.58/1.80  
% 1.58/1.80  list(usable).
% 1.58/1.80  0 [] A=A.
% 1.58/1.80  0 [] -iext(uri_rdf_type,X,C)|icext(C,X).
% 1.58/1.80  0 [] iext(uri_rdf_type,X,C)| -icext(C,X).
% 1.58/1.80  0 [] -iext(uri_rdf_first,S1,A1)| -iext(uri_rdf_rest,S1,uri_rdf_nil)| -iext(uri_owl_oneOf,Z,S1)|ic(Z).
% 1.58/1.80  0 [] -iext(uri_rdf_first,S1,A1)| -iext(uri_rdf_rest,S1,uri_rdf_nil)| -iext(uri_owl_oneOf,Z,S1)| -icext(Z,X)|X=A1.
% 1.58/1.80  0 [] -iext(uri_rdf_first,S1,A1)| -iext(uri_rdf_rest,S1,uri_rdf_nil)| -iext(uri_owl_oneOf,Z,S1)|icext(Z,X)|X!=A1.
% 1.58/1.80  0 [] -iext(uri_rdf_first,S1,A1)| -iext(uri_rdf_rest,S1,uri_rdf_nil)|iext(uri_owl_oneOf,Z,S1)| -ic(Z)|icext(Z,$f1(Z,S1,A1))|$f1(Z,S1,A1)=A1.
% 1.58/1.80  0 [] -iext(uri_rdf_first,S1,A1)| -iext(uri_rdf_rest,S1,uri_rdf_nil)|iext(uri_owl_oneOf,Z,S1)| -ic(Z)| -icext(Z,$f1(Z,S1,A1))|$f1(Z,S1,A1)!=A1.
% 1.58/1.80  0 [] -icext(uri_owl_FunctionalProperty,P)|ip(P).
% 1.58/1.80  0 [] -icext(uri_owl_FunctionalProperty,P)| -iext(P,X,Y1)| -iext(P,X,Y2)|Y1=Y2.
% 1.58/1.80  0 [] icext(uri_owl_FunctionalProperty,P)| -ip(P)|iext(P,$f4(P),$f3(P)).
% 1.58/1.80  0 [] icext(uri_owl_FunctionalProperty,P)| -ip(P)|iext(P,$f4(P),$f2(P)).
% 1.58/1.80  0 [] icext(uri_owl_FunctionalProperty,P)| -ip(P)|$f3(P)!=$f2(P).
% 1.58/1.80  0 [] -iext(uri_owl_sameAs,X,Y)|X=Y.
% 1.58/1.80  0 [] iext(uri_owl_sameAs,X,Y)|X!=Y.
% 1.58/1.80  0 [] -iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)| -iext(uri_owl_sameAs,uri_ex_w,uri_ex_v).
% 1.58/1.80  0 [] iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty).
% 1.58/1.80  0 [] iext(uri_rdf_type,uri_ex_w,$c2).
% 1.58/1.80  0 [] iext(uri_rdf_type,$c2,uri_owl_Class).
% 1.58/1.80  0 [] iext(uri_owl_oneOf,$c2,$c1).
% 1.58/1.80  0 [] iext(uri_rdf_first,$c1,uri_ex_u).
% 1.58/1.80  0 [] iext(uri_rdf_first,$c1,uri_ex_v).
% 1.58/1.80  0 [] iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 1.58/1.80  end_of_list.
% 1.58/1.80  
% 1.58/1.80  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.58/1.80  
% 1.58/1.80  This ia a non-Horn set with equality.  The strategy will be
% 1.58/1.80  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.58/1.80  deletion, with positive clauses in sos and nonpositive
% 1.58/1.80  clauses in usable.
% 1.58/1.80  
% 1.58/1.80     dependent: set(knuth_bendix).
% 1.58/1.80     dependent: set(anl_eq).
% 1.58/1.80     dependent: set(para_from).
% 1.58/1.80     dependent: set(para_into).
% 1.58/1.80     dependent: clear(para_from_right).
% 1.58/1.80     dependent: clear(para_into_right).
% 1.58/1.80     dependent: set(para_from_vars).
% 1.58/1.80     dependent: set(eq_units_both_ways).
% 1.58/1.80     dependent: set(dynamic_demod_all).
% 1.58/1.80     dependent: set(dynamic_demod).
% 1.58/1.80     dependent: set(order_eq).
% 1.58/1.80     dependent: set(back_demod).
% 1.58/1.80     dependent: set(lrpo).
% 1.58/1.80     dependent: set(hyper_res).
% 1.58/1.80     dependent: set(unit_deletion).
% 1.58/1.80     dependent: set(factor).
% 1.58/1.80  
% 1.58/1.80  ------------> process usable:
% 1.58/1.80  ** KEPT (pick-wt=7): 1 [] -iext(uri_rdf_type,A,B)|icext(B,A).
% 1.58/1.80  ** KEPT (pick-wt=7): 2 [] iext(uri_rdf_type,A,B)| -icext(B,A).
% 1.58/1.80  ** KEPT (pick-wt=14): 3 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,uri_rdf_nil)| -iext(uri_owl_oneOf,C,A)|ic(C).
% 1.58/1.80  ** KEPT (pick-wt=18): 4 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,uri_rdf_nil)| -iext(uri_owl_oneOf,C,A)| -icext(C,D)|D=B.
% 1.58/1.80  ** KEPT (pick-wt=18): 5 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,uri_rdf_nil)| -iext(uri_owl_oneOf,C,A)|icext(C,D)|D!=B.
% 1.58/1.80  ** KEPT (pick-wt=26): 6 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,uri_rdf_nil)|iext(uri_owl_oneOf,C,A)| -ic(C)|icext(C,$f1(C,A,B))|$f1(C,A,B)=B.
% 1.58/1.80  ** KEPT (pick-wt=26): 7 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,uri_rdf_nil)|iext(uri_owl_oneOf,C,A)| -ic(C)| -icext(C,$f1(C,A,B))|$f1(C,A,B)!=B.
% 1.58/1.80  ** KEPT (pick-wt=5): 8 [] -icext(uri_owl_FunctionalProperty,A)|ip(A).
% 1.58/1.80  ** KEPT (pick-wt=14): 9 [] -icext(uri_owl_FunctionalProperty,A)| -iext(A,B,C)| -iext(A,B,D)|C=D.
% 1.58/1.80  ** KEPT (pick-wt=11): 10 [] icext(uri_owl_FunctionalProperty,A)| -ip(A)|iext(A,$f4(A),$f3(A)).
% 1.58/1.80  ** KEPT (pick-wt=11): 11 [] icext(uri_owl_FunctionalProperty,A)| -ip(A)|iext(A,$f4(A),$f2(A)).
% 1.58/1.80  ** KEPT (pick-wt=10): 12 [] icext(uri_owl_FunctionalProperty,A)| -ip(A)|$f3(A)!=$f2(A).
% 1.58/1.80  ** KEPT (pick-wt=7): 13 [] -iext(uri_owl_sameAs,A,B)|A=B.
% 1.58/1.80  ** KEPT (pick-wt=7): 14 [] iext(uri_owl_sameAs,A,B)|A!=B.
% 1.58/1.80  ** KEPT (pick-wt=8): 15 [] -iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)| -iext(uri_owl_sameAs,uri_ex_w,uri_ex_v).
% 1.58/1.80  
% 1.58/1.80  ------------> process sos:
% 1.58/1.80  ** KEPT (pick-wt=3): 17 [] A=A.
% 1.58/1.80  ** KEPT (pick-wt=4): 18 [] iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty).
% 1.58/1.80  ** KEPT (pick-wt=4): 19 [] iext(uri_rdf_type,uri_ex_w,$c2).
% 1.58/1.80  ** KEPT (pick-wt=4): 20 [] iext(uri_rdf_type,$c2,uri_owl_Class).
% 1.58/1.80  ** KEPT (pick-wt=4): 21 [] iext(uri_owl_oneOf,$c2,$c1).
% 1.58/1.80  ** KEPT (pick-wt=4): 22 [] iext(uri_rdf_first,$c1,uri_ex_u).
% 1.58/1.80  ** KEPT (pick-wt=4): 23 [] iext(uri_rdf_first,$c1,uri_ex_v).
% 1.58/1.80  ** KEPT (pick-wt=4): 24 [] iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 1.58/1.80    Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] A=A.
% 1.58/1.80  17 back subsumes 16.
% 1.58/1.80  
% 1.58/1.80  ======= end of input processing =======
% 1.58/1.80  
% 1.58/1.80  =========== start of search ===========
% 1.58/1.80  
% 1.58/1.80  -------- PROOF -------- 
% 1.58/1.80  
% 1.58/1.80  ----> UNIT CONFLICT at   0.00 sec ----> 106 [binary,105.1,25.1] $F.
% 1.58/1.80  
% 1.58/1.80  Length of proof is 7.  Level of proof is 4.
% 1.58/1.80  
% 1.58/1.80  ---------------- PROOF ----------------
% 1.58/1.80  % SZS status Theorem
% 1.58/1.80  % SZS output start Refutation
% See solution above
% 1.58/1.80  ------------ end of proof -------------
% 1.58/1.80  
% 1.58/1.80  
% 1.58/1.80  Search stopped by max_proofs option.
% 1.58/1.80  
% 1.58/1.80  
% 1.58/1.80  Search stopped by max_proofs option.
% 1.58/1.80  
% 1.58/1.80  ============ end of search ============
% 1.58/1.80  
% 1.58/1.80  -------------- statistics -------------
% 1.58/1.80  clauses given                 13
% 1.58/1.80  clauses generated            115
% 1.58/1.80  clauses kept                 103
% 1.58/1.80  clauses forward subsumed      39
% 1.58/1.80  clauses back subsumed          1
% 1.58/1.80  Kbytes malloced              976
% 1.58/1.80  
% 1.58/1.80  ----------- times (seconds) -----------
% 1.58/1.80  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.58/1.80  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.58/1.80  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.58/1.80  
% 1.58/1.80  That finishes the proof of the theorem.
% 1.58/1.80  
% 1.58/1.80  Process 3112 finished Wed Jul 27 02:14:47 2022
% 1.58/1.80  Otter interrupted
% 1.58/1.80  PROOF FOUND
%------------------------------------------------------------------------------