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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : KRS134+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n026.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:24 EDT 2022

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

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

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

cnf(3,axiom,
    ( ~ rprop(A,B)
    | cA(B) ),
    file('KRS134+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | xsd_string(dollar_c2)
    | ~ xsd_integer(dollar_c2)
    | rprop(dollar_c4,dollar_c3) ),
    file('KRS134+1.p',unknown),
    [] ).

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

cnf(8,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | xsd_string(dollar_c2)
    | ~ xsd_integer(dollar_c2)
    | ~ cA(dollar_c3) ),
    file('KRS134+1.p',unknown),
    [] ).

cnf(9,plain,
    ( ~ cowlThing(dollar_c1)
    | xsd_string(dollar_c2)
    | ~ xsd_integer(dollar_c2)
    | ~ cA(dollar_c3) ),
    inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[8]),1]),
    [iquote('copy,8,unit_del,1')] ).

cnf(12,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | ~ xsd_string(dollar_c2)
    | xsd_integer(dollar_c2)
    | rprop(dollar_c4,dollar_c3) ),
    file('KRS134+1.p',unknown),
    [] ).

cnf(13,plain,
    ( ~ cowlThing(dollar_c1)
    | ~ xsd_string(dollar_c2)
    | xsd_integer(dollar_c2)
    | rprop(dollar_c4,dollar_c3) ),
    inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[12]),1]),
    [iquote('copy,12,unit_del,1')] ).

cnf(14,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | ~ xsd_string(dollar_c2)
    | xsd_integer(dollar_c2)
    | ~ cA(dollar_c3) ),
    file('KRS134+1.p',unknown),
    [] ).

cnf(15,plain,
    ( ~ cowlThing(dollar_c1)
    | ~ xsd_string(dollar_c2)
    | xsd_integer(dollar_c2)
    | ~ cA(dollar_c3) ),
    inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[14]),1]),
    [iquote('copy,14,unit_del,1')] ).

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

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

cnf(18,plain,
    ( xsd_integer(dollar_c2)
    | rprop(dollar_c4,dollar_c3) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[17,13,16])]),
    [iquote('hyper,17,13,16,factor_simp')] ).

cnf(19,plain,
    ( rprop(dollar_c4,dollar_c3)
    | xsd_string(dollar_c2) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[18,7,16])]),
    [iquote('hyper,18,7,16,factor_simp')] ).

cnf(20,plain,
    rprop(dollar_c4,dollar_c3),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[19,2,18])]),
    [iquote('hyper,19,2,18,factor_simp')] ).

cnf(21,plain,
    cA(dollar_c3),
    inference(hyper,[status(thm)],[20,3]),
    [iquote('hyper,20,3')] ).

cnf(22,plain,
    xsd_integer(dollar_c2),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[21,15,16,17])]),
    [iquote('hyper,21,15,16,17,factor_simp')] ).

cnf(23,plain,
    xsd_string(dollar_c2),
    inference(hyper,[status(thm)],[22,9,16,21]),
    [iquote('hyper,22,9,16,21')] ).

cnf(24,plain,
    $false,
    inference(hyper,[status(thm)],[23,2,22]),
    [iquote('hyper,23,2,22')] ).

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