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

View Problem - Process Solution

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

% Computer : n003.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:43 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ( iext(uri_owl_sameAs,A,B)
    | A != B ),
    file('SWB015+2.p',unknown),
    [] ).

cnf(3,axiom,
    ~ iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs),
    file('SWB015+2.p',unknown),
    [] ).

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

cnf(5,plain,
    iext(uri_owl_sameAs,A,A),
    inference(hyper,[status(thm)],[4,2]),
    [iquote('hyper,4,2')] ).

cnf(6,plain,
    $false,
    inference(binary,[status(thm)],[5,3]),
    [iquote('binary,5.1,3.1')] ).

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