TSTP Solution File: KRS141+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : KRS141+1 : TPTP v8.1.0. Released v3.1.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:01:25 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ cowlNothing(A),
    file('KRS141+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ xsd_string(A)
    | ~ xsd_integer(A) ),
    file('KRS141+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ cr(A)
    | ~ rp(A,B)
    | cc(B) ),
    file('KRS141+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | xsd_string(dollar_c2)
    | ~ xsd_integer(dollar_c2)
    | ~ cc(io)
    | ~ cowlThing(io) ),
    file('KRS141+1.p',unknown),
    [] ).

cnf(5,plain,
    ( ~ cowlThing(dollar_c1)
    | xsd_string(dollar_c2)
    | ~ xsd_integer(dollar_c2)
    | ~ cc(io)
    | ~ cowlThing(io) ),
    inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[4]),1]),
    [iquote('copy,4,unit_del,1')] ).

cnf(6,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | ~ xsd_string(dollar_c2)
    | xsd_integer(dollar_c2)
    | ~ cc(io)
    | ~ cowlThing(io) ),
    file('KRS141+1.p',unknown),
    [] ).

cnf(7,plain,
    ( ~ cowlThing(dollar_c1)
    | ~ xsd_string(dollar_c2)
    | xsd_integer(dollar_c2)
    | ~ cc(io)
    | ~ cowlThing(io) ),
    inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[6]),1]),
    [iquote('copy,6,unit_del,1')] ).

cnf(8,axiom,
    cowlThing(A),
    file('KRS141+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( xsd_string(A)
    | xsd_integer(A) ),
    file('KRS141+1.p',unknown),
    [] ).

cnf(10,axiom,
    cr(ii),
    file('KRS141+1.p',unknown),
    [] ).

cnf(11,axiom,
    rp(ii,io),
    file('KRS141+1.p',unknown),
    [] ).

cnf(12,plain,
    cc(io),
    inference(hyper,[status(thm)],[11,3,10]),
    [iquote('hyper,11,3,10')] ).

cnf(13,plain,
    xsd_integer(dollar_c2),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[9,7,8,12,8])]),
    [iquote('hyper,9,7,8,12,8,factor_simp')] ).

cnf(14,plain,
    xsd_string(dollar_c2),
    inference(hyper,[status(thm)],[13,5,8,12,8]),
    [iquote('hyper,13,5,8,12,8')] ).

cnf(15,plain,
    $false,
    inference(hyper,[status(thm)],[14,2,13]),
    [iquote('hyper,14,2,13')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : KRS141+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/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 03:29:26 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.70/1.92  ----- Otter 3.3f, August 2004 -----
% 1.70/1.92  The process was started by sandbox on n003.cluster.edu,
% 1.70/1.92  Wed Jul 27 03:29:26 2022
% 1.70/1.92  The command was "./otter".  The process ID is 4527.
% 1.70/1.92  
% 1.70/1.92  set(prolog_style_variables).
% 1.70/1.92  set(auto).
% 1.70/1.92     dependent: set(auto1).
% 1.70/1.92     dependent: set(process_input).
% 1.70/1.92     dependent: clear(print_kept).
% 1.70/1.92     dependent: clear(print_new_demod).
% 1.70/1.92     dependent: clear(print_back_demod).
% 1.70/1.92     dependent: clear(print_back_sub).
% 1.70/1.92     dependent: set(control_memory).
% 1.70/1.92     dependent: assign(max_mem, 12000).
% 1.70/1.92     dependent: assign(pick_given_ratio, 4).
% 1.70/1.92     dependent: assign(stats_level, 1).
% 1.70/1.92     dependent: assign(max_seconds, 10800).
% 1.70/1.92  clear(print_given).
% 1.70/1.92  
% 1.70/1.92  formula_list(usable).
% 1.70/1.92  all X (cowlThing(X)& -cowlNothing(X)).
% 1.70/1.92  all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.70/1.92  all X (cr(X)-> (all Y (rp(X,Y)->cc(Y)))).
% 1.70/1.92  cr(ii).
% 1.70/1.92  cowlThing(ii).
% 1.70/1.92  rp(ii,io).
% 1.70/1.92  cowlThing(io).
% 1.70/1.92  -((all X (cowlThing(X)& -cowlNothing(X)))& (all X (xsd_string(X)<-> -xsd_integer(X)))&cc(io)&cowlThing(io)).
% 1.70/1.92  end_of_list.
% 1.70/1.92  
% 1.70/1.92  -------> usable clausifies to:
% 1.70/1.92  
% 1.70/1.92  list(usable).
% 1.70/1.92  0 [] cowlThing(X).
% 1.70/1.92  0 [] -cowlNothing(X).
% 1.70/1.92  0 [] -xsd_string(X)| -xsd_integer(X).
% 1.70/1.92  0 [] xsd_string(X)|xsd_integer(X).
% 1.70/1.92  0 [] -cr(X)| -rp(X,Y)|cc(Y).
% 1.70/1.92  0 [] cr(ii).
% 1.70/1.92  0 [] cowlThing(ii).
% 1.70/1.92  0 [] rp(ii,io).
% 1.70/1.92  0 [] cowlThing(io).
% 1.70/1.92  0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cc(io)| -cowlThing(io).
% 1.70/1.92  0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cc(io)| -cowlThing(io).
% 1.70/1.92  end_of_list.
% 1.70/1.92  
% 1.70/1.92  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.70/1.92  
% 1.70/1.92  This is a non-Horn set without equality.  The strategy will
% 1.70/1.92  be ordered hyper_res, unit deletion, and factoring, with
% 1.70/1.92  satellites in sos and with nuclei in usable.
% 1.70/1.92  
% 1.70/1.92     dependent: set(hyper_res).
% 1.70/1.92     dependent: set(factor).
% 1.70/1.92     dependent: set(unit_deletion).
% 1.70/1.92  
% 1.70/1.92  ------------> process usable:
% 1.70/1.92  ** KEPT (pick-wt=2): 1 [] -cowlNothing(A).
% 1.70/1.92  ** KEPT (pick-wt=4): 2 [] -xsd_string(A)| -xsd_integer(A).
% 1.70/1.92  ** KEPT (pick-wt=7): 3 [] -cr(A)| -rp(A,B)|cc(B).
% 1.70/1.92  ** KEPT (pick-wt=10): 5 [copy,4,unit_del,1] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cc(io)| -cowlThing(io).
% 1.70/1.92  ** KEPT (pick-wt=10): 7 [copy,6,unit_del,1] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cc(io)| -cowlThing(io).
% 1.70/1.92  
% 1.70/1.92  ------------> process sos:
% 1.70/1.92  ** KEPT (pick-wt=2): 8 [] cowlThing(A).
% 1.70/1.92  ** KEPT (pick-wt=4): 9 [] xsd_string(A)|xsd_integer(A).
% 1.70/1.92  ** KEPT (pick-wt=2): 10 [] cr(ii).
% 1.70/1.92    Following clause subsumed by 8 during input processing: 0 [] cowlThing(ii).
% 1.70/1.92  ** KEPT (pick-wt=3): 11 [] rp(ii,io).
% 1.70/1.92    Following clause subsumed by 8 during input processing: 0 [] cowlThing(io).
% 1.70/1.92  
% 1.70/1.92  ======= end of input processing =======
% 1.70/1.92  
% 1.70/1.92  =========== start of search ===========
% 1.70/1.92  
% 1.70/1.92  -------- PROOF -------- 
% 1.70/1.92  
% 1.70/1.92  -----> EMPTY CLAUSE at   0.00 sec ----> 15 [hyper,14,2,13] $F.
% 1.70/1.92  
% 1.70/1.92  Length of proof is 5.  Level of proof is 3.
% 1.70/1.92  
% 1.70/1.92  ---------------- PROOF ----------------
% 1.70/1.92  % SZS status Theorem
% 1.70/1.92  % SZS output start Refutation
% See solution above
% 1.70/1.92  ------------ end of proof -------------
% 1.70/1.92  
% 1.70/1.92  
% 1.70/1.92  Search stopped by max_proofs option.
% 1.70/1.92  
% 1.70/1.92  
% 1.70/1.92  Search stopped by max_proofs option.
% 1.70/1.92  
% 1.70/1.92  ============ end of search ============
% 1.70/1.92  
% 1.70/1.92  -------------- statistics -------------
% 1.70/1.92  clauses given                  7
% 1.70/1.92  clauses generated              5
% 1.70/1.92  clauses kept                  12
% 1.70/1.92  clauses forward subsumed       3
% 1.70/1.92  clauses back subsumed          2
% 1.70/1.92  Kbytes malloced              976
% 1.70/1.92  
% 1.70/1.92  ----------- times (seconds) -----------
% 1.70/1.92  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.70/1.92  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.70/1.92  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.70/1.92  
% 1.70/1.92  That finishes the proof of the theorem.
% 1.70/1.92  
% 1.70/1.92  Process 4527 finished Wed Jul 27 03:29:28 2022
% 1.70/1.92  Otter interrupted
% 1.70/1.92  PROOF FOUND
%------------------------------------------------------------------------------