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

View Problem - Process Solution

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

% Computer : n027.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:11:39 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ patricide(thersandros),
    file('PUZ128+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ parent_of(iokaste,A)
    | ~ patricide(A)
    | ~ parent_of(A,B)
    | patricide(B) ),
    file('PUZ128+1.p',unknown),
    [] ).

cnf(3,axiom,
    parent_of(iokaste,oedipus),
    file('PUZ128+1.p',unknown),
    [] ).

cnf(4,axiom,
    parent_of(iokaste,polyneikes),
    file('PUZ128+1.p',unknown),
    [] ).

cnf(5,axiom,
    parent_of(oedipus,polyneikes),
    file('PUZ128+1.p',unknown),
    [] ).

cnf(6,axiom,
    parent_of(polyneikes,thersandros),
    file('PUZ128+1.p',unknown),
    [] ).

cnf(7,axiom,
    patricide(oedipus),
    file('PUZ128+1.p',unknown),
    [] ).

cnf(8,plain,
    patricide(polyneikes),
    inference(hyper,[status(thm)],[5,2,3,7]),
    [iquote('hyper,5,2,3,7')] ).

cnf(9,plain,
    patricide(thersandros),
    inference(hyper,[status(thm)],[6,2,4,8]),
    [iquote('hyper,6,2,4,8')] ).

cnf(10,plain,
    $false,
    inference(binary,[status(thm)],[9,1]),
    [iquote('binary,9.1,1.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : PUZ128+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n027.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:02:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.53/1.75  ----- Otter 3.3f, August 2004 -----
% 1.53/1.75  The process was started by sandbox2 on n027.cluster.edu,
% 1.53/1.75  Wed Jul 27 02:02:06 2022
% 1.53/1.75  The command was "./otter".  The process ID is 4071.
% 1.53/1.75  
% 1.53/1.75  set(prolog_style_variables).
% 1.53/1.75  set(auto).
% 1.53/1.75     dependent: set(auto1).
% 1.53/1.75     dependent: set(process_input).
% 1.53/1.75     dependent: clear(print_kept).
% 1.53/1.75     dependent: clear(print_new_demod).
% 1.53/1.75     dependent: clear(print_back_demod).
% 1.53/1.75     dependent: clear(print_back_sub).
% 1.53/1.75     dependent: set(control_memory).
% 1.53/1.75     dependent: assign(max_mem, 12000).
% 1.53/1.75     dependent: assign(pick_given_ratio, 4).
% 1.53/1.75     dependent: assign(stats_level, 1).
% 1.53/1.75     dependent: assign(max_seconds, 10800).
% 1.53/1.75  clear(print_given).
% 1.53/1.75  
% 1.53/1.75  formula_list(usable).
% 1.53/1.75  parent_of(iokaste,oedipus).
% 1.53/1.75  parent_of(iokaste,polyneikes).
% 1.53/1.75  parent_of(oedipus,polyneikes).
% 1.53/1.75  parent_of(polyneikes,thersandros).
% 1.53/1.75  patricide(oedipus).
% 1.53/1.75  -patricide(thersandros).
% 1.53/1.75  -(exists P NP (parent_of(iokaste,P)&patricide(P)&parent_of(P,NP)& -patricide(NP))).
% 1.53/1.75  end_of_list.
% 1.53/1.75  
% 1.53/1.75  -------> usable clausifies to:
% 1.53/1.75  
% 1.53/1.75  list(usable).
% 1.53/1.75  0 [] parent_of(iokaste,oedipus).
% 1.53/1.75  0 [] parent_of(iokaste,polyneikes).
% 1.53/1.75  0 [] parent_of(oedipus,polyneikes).
% 1.53/1.75  0 [] parent_of(polyneikes,thersandros).
% 1.53/1.75  0 [] patricide(oedipus).
% 1.53/1.75  0 [] -patricide(thersandros).
% 1.53/1.75  0 [] -parent_of(iokaste,P)| -patricide(P)| -parent_of(P,NP)|patricide(NP).
% 1.53/1.75  end_of_list.
% 1.53/1.75  
% 1.53/1.75  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.53/1.75  
% 1.53/1.75  This is a Horn set without equality.  The strategy will
% 1.53/1.75  be hyperresolution, with satellites in sos and nuclei
% 1.53/1.75  in usable.
% 1.53/1.75  
% 1.53/1.75     dependent: set(hyper_res).
% 1.53/1.75     dependent: clear(order_hyper).
% 1.53/1.75  
% 1.53/1.75  ------------> process usable:
% 1.53/1.75  ** KEPT (pick-wt=2): 1 [] -patricide(thersandros).
% 1.53/1.75  ** KEPT (pick-wt=10): 2 [] -parent_of(iokaste,A)| -patricide(A)| -parent_of(A,B)|patricide(B).
% 1.53/1.75  
% 1.53/1.75  ------------> process sos:
% 1.53/1.75  ** KEPT (pick-wt=3): 3 [] parent_of(iokaste,oedipus).
% 1.53/1.75  ** KEPT (pick-wt=3): 4 [] parent_of(iokaste,polyneikes).
% 1.53/1.75  ** KEPT (pick-wt=3): 5 [] parent_of(oedipus,polyneikes).
% 1.53/1.75  ** KEPT (pick-wt=3): 6 [] parent_of(polyneikes,thersandros).
% 1.53/1.75  ** KEPT (pick-wt=2): 7 [] patricide(oedipus).
% 1.53/1.75  
% 1.53/1.75  ======= end of input processing =======
% 1.53/1.75  
% 1.53/1.75  =========== start of search ===========
% 1.53/1.75  
% 1.53/1.75  -------- PROOF -------- 
% 1.53/1.75  
% 1.53/1.75  ----> UNIT CONFLICT at   0.00 sec ----> 10 [binary,9.1,1.1] $F.
% 1.53/1.75  
% 1.53/1.75  Length of proof is 2.  Level of proof is 2.
% 1.53/1.75  
% 1.53/1.75  ---------------- PROOF ----------------
% 1.53/1.75  % SZS status Theorem
% 1.53/1.75  % SZS output start Refutation
% See solution above
% 1.53/1.75  ------------ end of proof -------------
% 1.53/1.75  
% 1.53/1.75  
% 1.53/1.75  Search stopped by max_proofs option.
% 1.53/1.75  
% 1.53/1.75  
% 1.53/1.75  Search stopped by max_proofs option.
% 1.53/1.75  
% 1.53/1.75  ============ end of search ============
% 1.53/1.75  
% 1.53/1.75  -------------- statistics -------------
% 1.53/1.75  clauses given                  6
% 1.53/1.75  clauses generated              2
% 1.53/1.75  clauses kept                   9
% 1.53/1.75  clauses forward subsumed       0
% 1.53/1.75  clauses back subsumed          0
% 1.53/1.75  Kbytes malloced              976
% 1.53/1.75  
% 1.53/1.75  ----------- times (seconds) -----------
% 1.53/1.75  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.53/1.75  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.53/1.75  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.53/1.75  
% 1.53/1.75  That finishes the proof of the theorem.
% 1.53/1.75  
% 1.53/1.75  Process 4071 finished Wed Jul 27 02:02:08 2022
% 1.53/1.75  Otter interrupted
% 1.53/1.75  PROOF FOUND
%------------------------------------------------------------------------------