TSTP Solution File: PUZ003-1 by Otter---3.3

View Problem - Process Solution

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

% Computer : n015.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:01 EDT 2022

% Result   : Unsatisfiable 1.94s 2.10s
% Output   : Refutation 1.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   13 (  11 unt;   0 nHn;  13 RR)
%            Number of literals    :   18 (   0 equ;   6 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    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ member(A)
    | ~ member(B)
    | ~ shaved(A,B)
    | shaved(members,A) ),
    file('PUZ003-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ shaved(members,A)
    | ~ member(B)
    | shaved(B,A) ),
    file('PUZ003-1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ shaved(petruchio,lorenzo),
    file('PUZ003-1.p',unknown),
    [] ).

cnf(4,axiom,
    member(guido),
    file('PUZ003-1.p',unknown),
    [] ).

cnf(5,axiom,
    member(lorenzo),
    file('PUZ003-1.p',unknown),
    [] ).

cnf(6,axiom,
    member(petruchio),
    file('PUZ003-1.p',unknown),
    [] ).

cnf(7,axiom,
    member(cesare),
    file('PUZ003-1.p',unknown),
    [] ).

cnf(8,axiom,
    shaved(guido,cesare),
    file('PUZ003-1.p',unknown),
    [] ).

cnf(9,plain,
    shaved(members,guido),
    inference(hyper,[status(thm)],[8,1,4,7]),
    [iquote('hyper,8,1,4,7')] ).

cnf(12,plain,
    shaved(lorenzo,guido),
    inference(hyper,[status(thm)],[9,2,5]),
    [iquote('hyper,9,2,5')] ).

cnf(16,plain,
    shaved(members,lorenzo),
    inference(hyper,[status(thm)],[12,1,5,4]),
    [iquote('hyper,12,1,5,4')] ).

cnf(25,plain,
    shaved(petruchio,lorenzo),
    inference(hyper,[status(thm)],[16,2,6]),
    [iquote('hyper,16,2,6')] ).

cnf(26,plain,
    $false,
    inference(binary,[status(thm)],[25,3]),
    [iquote('binary,25.1,3.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : PUZ003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.13  % Command  : otter-tptp-script %s
% 0.14/0.34  % Computer : n015.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Wed Jul 27 01:58:41 EDT 2022
% 0.20/0.34  % CPUTime  : 
% 1.94/2.10  ----- Otter 3.3f, August 2004 -----
% 1.94/2.10  The process was started by sandbox2 on n015.cluster.edu,
% 1.94/2.10  Wed Jul 27 01:58:41 2022
% 1.94/2.10  The command was "./otter".  The process ID is 27754.
% 1.94/2.10  
% 1.94/2.10  set(prolog_style_variables).
% 1.94/2.10  set(auto).
% 1.94/2.10     dependent: set(auto1).
% 1.94/2.10     dependent: set(process_input).
% 1.94/2.10     dependent: clear(print_kept).
% 1.94/2.10     dependent: clear(print_new_demod).
% 1.94/2.10     dependent: clear(print_back_demod).
% 1.94/2.10     dependent: clear(print_back_sub).
% 1.94/2.10     dependent: set(control_memory).
% 1.94/2.10     dependent: assign(max_mem, 12000).
% 1.94/2.10     dependent: assign(pick_given_ratio, 4).
% 1.94/2.10     dependent: assign(stats_level, 1).
% 1.94/2.10     dependent: assign(max_seconds, 10800).
% 1.94/2.10  clear(print_given).
% 1.94/2.10  
% 1.94/2.10  list(usable).
% 1.94/2.10  0 [] -member(X)| -member(Y)| -shaved(X,Y)|shaved(members,X).
% 1.94/2.10  0 [] -shaved(members,X)| -member(Y)|shaved(Y,X).
% 1.94/2.10  0 [] member(guido).
% 1.94/2.10  0 [] member(lorenzo).
% 1.94/2.10  0 [] member(petruchio).
% 1.94/2.10  0 [] member(cesare).
% 1.94/2.10  0 [] shaved(guido,cesare).
% 1.94/2.10  0 [] -shaved(petruchio,lorenzo).
% 1.94/2.10  end_of_list.
% 1.94/2.10  
% 1.94/2.10  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.94/2.10  
% 1.94/2.10  This is a Horn set without equality.  The strategy will
% 1.94/2.10  be hyperresolution, with satellites in sos and nuclei
% 1.94/2.10  in usable.
% 1.94/2.10  
% 1.94/2.10     dependent: set(hyper_res).
% 1.94/2.10     dependent: clear(order_hyper).
% 1.94/2.10  
% 1.94/2.10  ------------> process usable:
% 1.94/2.10  ** KEPT (pick-wt=10): 1 [] -member(A)| -member(B)| -shaved(A,B)|shaved(members,A).
% 1.94/2.10  ** KEPT (pick-wt=8): 2 [] -shaved(members,A)| -member(B)|shaved(B,A).
% 1.94/2.10  ** KEPT (pick-wt=3): 3 [] -shaved(petruchio,lorenzo).
% 1.94/2.10  
% 1.94/2.10  ------------> process sos:
% 1.94/2.10  ** KEPT (pick-wt=2): 4 [] member(guido).
% 1.94/2.10  ** KEPT (pick-wt=2): 5 [] member(lorenzo).
% 1.94/2.10  ** KEPT (pick-wt=2): 6 [] member(petruchio).
% 1.94/2.10  ** KEPT (pick-wt=2): 7 [] member(cesare).
% 1.94/2.10  ** KEPT (pick-wt=3): 8 [] shaved(guido,cesare).
% 1.94/2.10  
% 1.94/2.10  ======= end of input processing =======
% 1.94/2.10  
% 1.94/2.10  =========== start of search ===========
% 1.94/2.10  
% 1.94/2.10  -------- PROOF -------- 
% 1.94/2.10  
% 1.94/2.10  ----> UNIT CONFLICT at   0.00 sec ----> 26 [binary,25.1,3.1] $F.
% 1.94/2.10  
% 1.94/2.10  Length of proof is 4.  Level of proof is 4.
% 1.94/2.10  
% 1.94/2.10  ---------------- PROOF ----------------
% 1.94/2.10  % SZS status Unsatisfiable
% 1.94/2.10  % SZS output start Refutation
% See solution above
% 1.94/2.10  ------------ end of proof -------------
% 1.94/2.10  
% 1.94/2.10  
% 1.94/2.10  Search stopped by max_proofs option.
% 1.94/2.10  
% 1.94/2.10  
% 1.94/2.10  Search stopped by max_proofs option.
% 1.94/2.10  
% 1.94/2.10  ============ end of search ============
% 1.94/2.10  
% 1.94/2.10  -------------- statistics -------------
% 1.94/2.10  clauses given                 13
% 1.94/2.10  clauses generated             19
% 1.94/2.10  clauses kept                  25
% 1.94/2.10  clauses forward subsumed       2
% 1.94/2.10  clauses back subsumed          0
% 1.94/2.10  Kbytes malloced              976
% 1.94/2.10  
% 1.94/2.10  ----------- times (seconds) -----------
% 1.94/2.10  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.94/2.10  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.94/2.10  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.94/2.10  
% 1.94/2.10  That finishes the proof of the theorem.
% 1.94/2.10  
% 1.94/2.10  Process 27754 finished Wed Jul 27 01:58:43 2022
% 1.94/2.10  Otter interrupted
% 1.94/2.10  PROOF FOUND
%------------------------------------------------------------------------------