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

View Problem - Process Solution

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

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

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

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

cnf(3,axiom,
    ( ~ cAutomobile(A)
    | cCar(A) ),
    file('KRS166+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ cCar(A)
    | cAutomobile(A) ),
    file('KRS166+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | xsd_string(dollar_c2)
    | ~ xsd_integer(dollar_c2)
    | cCar(dollar_c3)
    | cAutomobile(dollar_c3) ),
    file('KRS166+1.p',unknown),
    [] ).

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

cnf(7,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | xsd_string(dollar_c2)
    | ~ xsd_integer(dollar_c2)
    | ~ cCar(dollar_c3)
    | ~ cAutomobile(dollar_c3) ),
    file('KRS166+1.p',unknown),
    [] ).

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

cnf(9,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | ~ xsd_string(dollar_c2)
    | xsd_integer(dollar_c2)
    | cCar(dollar_c3)
    | cAutomobile(dollar_c3) ),
    file('KRS166+1.p',unknown),
    [] ).

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

cnf(11,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | ~ xsd_string(dollar_c2)
    | xsd_integer(dollar_c2)
    | ~ cCar(dollar_c3)
    | ~ cAutomobile(dollar_c3) ),
    file('KRS166+1.p',unknown),
    [] ).

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

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

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

cnf(15,plain,
    ( xsd_integer(dollar_c2)
    | cCar(dollar_c3)
    | cAutomobile(dollar_c3) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[14,10,13])]),
    [iquote('hyper,14,10,13,factor_simp')] ).

cnf(16,plain,
    ( cCar(dollar_c3)
    | cAutomobile(dollar_c3)
    | xsd_string(dollar_c2) ),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[15,6,13])])]),
    [iquote('hyper,15,6,13,factor_simp,factor_simp')] ).

cnf(17,plain,
    ( cCar(dollar_c3)
    | cAutomobile(dollar_c3) ),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[16,2,15])])]),
    [iquote('hyper,16,2,15,factor_simp,factor_simp')] ).

cnf(18,plain,
    cAutomobile(dollar_c3),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[17,4])]),
    [iquote('hyper,17,4,factor_simp')] ).

cnf(19,plain,
    cCar(dollar_c3),
    inference(hyper,[status(thm)],[18,3]),
    [iquote('hyper,18,3')] ).

cnf(20,plain,
    xsd_integer(dollar_c2),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[19,12,13,14,18])]),
    [iquote('hyper,19,12,13,14,18,factor_simp')] ).

cnf(21,plain,
    xsd_string(dollar_c2),
    inference(hyper,[status(thm)],[20,8,13,19,18]),
    [iquote('hyper,20,8,13,19,18')] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : KRS166+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13  % Command  : otter-tptp-script %s
% 0.12/0.34  % Computer : n007.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit : 300
% 0.12/0.35  % WCLimit  : 300
% 0.12/0.35  % DateTime : Wed Jul 27 03:17:01 EDT 2022
% 0.12/0.35  % CPUTime  : 
% 1.77/1.96  ----- Otter 3.3f, August 2004 -----
% 1.77/1.96  The process was started by sandbox on n007.cluster.edu,
% 1.77/1.96  Wed Jul 27 03:17:01 2022
% 1.77/1.96  The command was "./otter".  The process ID is 18168.
% 1.77/1.96  
% 1.77/1.96  set(prolog_style_variables).
% 1.77/1.96  set(auto).
% 1.77/1.96     dependent: set(auto1).
% 1.77/1.96     dependent: set(process_input).
% 1.77/1.96     dependent: clear(print_kept).
% 1.77/1.96     dependent: clear(print_new_demod).
% 1.77/1.96     dependent: clear(print_back_demod).
% 1.77/1.96     dependent: clear(print_back_sub).
% 1.77/1.96     dependent: set(control_memory).
% 1.77/1.96     dependent: assign(max_mem, 12000).
% 1.77/1.96     dependent: assign(pick_given_ratio, 4).
% 1.77/1.96     dependent: assign(stats_level, 1).
% 1.77/1.96     dependent: assign(max_seconds, 10800).
% 1.77/1.96  clear(print_given).
% 1.77/1.96  
% 1.77/1.96  formula_list(usable).
% 1.77/1.96  all X (cowlThing(X)& -cowlNothing(X)).
% 1.77/1.96  all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.77/1.96  all X (cAutomobile(X)->cCar(X)).
% 1.77/1.96  all X (cCar(X)->cAutomobile(X)).
% 1.77/1.96  -((all X (cowlThing(X)& -cowlNothing(X)))& (all X (xsd_string(X)<-> -xsd_integer(X)))& (all X (cCar(X)<->cAutomobile(X)))).
% 1.77/1.96  end_of_list.
% 1.77/1.96  
% 1.77/1.96  -------> usable clausifies to:
% 1.77/1.96  
% 1.77/1.96  list(usable).
% 1.77/1.96  0 [] cowlThing(X).
% 1.77/1.96  0 [] -cowlNothing(X).
% 1.77/1.96  0 [] -xsd_string(X)| -xsd_integer(X).
% 1.77/1.96  0 [] xsd_string(X)|xsd_integer(X).
% 1.77/1.96  0 [] -cAutomobile(X)|cCar(X).
% 1.77/1.96  0 [] -cCar(X)|cAutomobile(X).
% 1.77/1.96  0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|cCar($c3)|cAutomobile($c3).
% 1.77/1.96  0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cCar($c3)| -cAutomobile($c3).
% 1.77/1.96  0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|cCar($c3)|cAutomobile($c3).
% 1.77/1.96  0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cCar($c3)| -cAutomobile($c3).
% 1.77/1.96  end_of_list.
% 1.77/1.96  
% 1.77/1.96  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.77/1.96  
% 1.77/1.96  This is a non-Horn set without equality.  The strategy will
% 1.77/1.96  be ordered hyper_res, unit deletion, and factoring, with
% 1.77/1.96  satellites in sos and with nuclei in usable.
% 1.77/1.96  
% 1.77/1.96     dependent: set(hyper_res).
% 1.77/1.96     dependent: set(factor).
% 1.77/1.96     dependent: set(unit_deletion).
% 1.77/1.96  
% 1.77/1.96  ------------> process usable:
% 1.77/1.96  ** KEPT (pick-wt=2): 1 [] -cowlNothing(A).
% 1.77/1.96  ** KEPT (pick-wt=4): 2 [] -xsd_string(A)| -xsd_integer(A).
% 1.77/1.96  ** KEPT (pick-wt=4): 3 [] -cAutomobile(A)|cCar(A).
% 1.77/1.96  ** KEPT (pick-wt=4): 4 [] -cCar(A)|cAutomobile(A).
% 1.77/1.96  ** KEPT (pick-wt=10): 6 [copy,5,unit_del,1] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|cCar($c3)|cAutomobile($c3).
% 1.77/1.96  ** KEPT (pick-wt=10): 8 [copy,7,unit_del,1] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cCar($c3)| -cAutomobile($c3).
% 1.77/1.96  ** KEPT (pick-wt=10): 10 [copy,9,unit_del,1] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|cCar($c3)|cAutomobile($c3).
% 1.77/1.96  ** KEPT (pick-wt=10): 12 [copy,11,unit_del,1] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cCar($c3)| -cAutomobile($c3).
% 1.77/1.96  
% 1.77/1.96  ------------> process sos:
% 1.77/1.96  ** KEPT (pick-wt=2): 13 [] cowlThing(A).
% 1.77/1.96  ** KEPT (pick-wt=4): 14 [] xsd_string(A)|xsd_integer(A).
% 1.77/1.96  
% 1.77/1.96  ======= end of input processing =======
% 1.77/1.96  
% 1.77/1.96  =========== start of search ===========
% 1.77/1.96  
% 1.77/1.96  -------- PROOF -------- 
% 1.77/1.96  
% 1.77/1.96  -----> EMPTY CLAUSE at   0.00 sec ----> 22 [hyper,21,2,20] $F.
% 1.77/1.96  
% 1.77/1.96  Length of proof is 11.  Level of proof is 8.
% 1.77/1.96  
% 1.77/1.96  ---------------- PROOF ----------------
% 1.77/1.96  % SZS status Theorem
% 1.77/1.96  % SZS output start Refutation
% See solution above
% 1.77/1.96  ------------ end of proof -------------
% 1.77/1.96  
% 1.77/1.96  
% 1.77/1.96  Search stopped by max_proofs option.
% 1.77/1.96  
% 1.77/1.96  
% 1.77/1.96  Search stopped by max_proofs option.
% 1.77/1.96  
% 1.77/1.96  ============ end of search ============
% 1.77/1.96  
% 1.77/1.96  -------------- statistics -------------
% 1.77/1.96  clauses given                  9
% 1.77/1.96  clauses generated             11
% 1.77/1.96  clauses kept                  17
% 1.77/1.96  clauses forward subsumed       3
% 1.77/1.96  clauses back subsumed          7
% 1.77/1.96  Kbytes malloced              976
% 1.77/1.96  
% 1.77/1.96  ----------- times (seconds) -----------
% 1.77/1.96  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.77/1.96  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.77/1.96  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.77/1.97  
% 1.77/1.97  That finishes the proof of the theorem.
% 1.77/1.97  
% 1.77/1.97  Process 18168 finished Wed Jul 27 03:17:02 2022
% 1.77/1.97  Otter interrupted
% 1.77/1.97  PROOF FOUND
%------------------------------------------------------------------------------