↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : PUZ012-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n016.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:02 EDT 2022

% Result   : Unsatisfiable 1.69s 1.89s
% Output   : Refutation 1.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   15 (   9 unt;   3 nHn;  14 RR)
%            Number of literals    :   23 (   0 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    6 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ label(A,B)
    | ~ contains(A,B) ),
    file('PUZ012-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ contains(A,B)
    | ~ contains(A,C)
    | e_qual_fruits(B,C) ),
    file('PUZ012-1.p',unknown),
    [] ).

cnf(7,axiom,
    ~ e_qual_fruits(apples,bananas),
    file('PUZ012-1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ e_qual_fruits(bananas,oranges),
    file('PUZ012-1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ contains(boxa,bananas)
    | ~ contains(boxc,oranges) ),
    file('PUZ012-1.p',unknown),
    [] ).

cnf(15,axiom,
    ( contains(boxa,A)
    | contains(boxb,A)
    | contains(boxc,A) ),
    file('PUZ012-1.p',unknown),
    [] ).

cnf(18,axiom,
    label(boxb,oranges),
    file('PUZ012-1.p',unknown),
    [] ).

cnf(19,axiom,
    label(boxc,bananas),
    file('PUZ012-1.p',unknown),
    [] ).

cnf(20,axiom,
    contains(boxb,apples),
    file('PUZ012-1.p',unknown),
    [] ).

cnf(24,plain,
    ( contains(boxa,oranges)
    | contains(boxc,oranges) ),
    inference(hyper,[status(thm)],[15,1,18]),
    [iquote('hyper,15,1,18')] ).

cnf(26,plain,
    ( contains(boxa,bananas)
    | contains(boxb,bananas) ),
    inference(hyper,[status(thm)],[15,1,19]),
    [iquote('hyper,15,1,19')] ).

cnf(39,plain,
    contains(boxa,bananas),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[26,2,20]),7]),
    [iquote('hyper,26,2,20,unit_del,7')] ).

cnf(40,plain,
    contains(boxa,oranges),
    inference(hyper,[status(thm)],[39,10,24]),
    [iquote('hyper,39,10,24')] ).

cnf(55,plain,
    e_qual_fruits(bananas,oranges),
    inference(hyper,[status(thm)],[40,2,39]),
    [iquote('hyper,40,2,39')] ).

cnf(56,plain,
    $false,
    inference(binary,[status(thm)],[55,8]),
    [iquote('binary,55.1,8.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : PUZ012-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n016.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:08:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.69/1.89  ----- Otter 3.3f, August 2004 -----
% 1.69/1.89  The process was started by sandbox2 on n016.cluster.edu,
% 1.69/1.89  Wed Jul 27 02:08:37 2022
% 1.69/1.89  The command was "./otter".  The process ID is 15194.
% 1.69/1.89  
% 1.69/1.89  set(prolog_style_variables).
% 1.69/1.89  set(auto).
% 1.69/1.89     dependent: set(auto1).
% 1.69/1.89     dependent: set(process_input).
% 1.69/1.89     dependent: clear(print_kept).
% 1.69/1.89     dependent: clear(print_new_demod).
% 1.69/1.89     dependent: clear(print_back_demod).
% 1.69/1.89     dependent: clear(print_back_sub).
% 1.69/1.89     dependent: set(control_memory).
% 1.69/1.89     dependent: assign(max_mem, 12000).
% 1.69/1.89     dependent: assign(pick_given_ratio, 4).
% 1.69/1.89     dependent: assign(stats_level, 1).
% 1.69/1.89     dependent: assign(max_seconds, 10800).
% 1.69/1.89  clear(print_given).
% 1.69/1.89  
% 1.69/1.89  list(usable).
% 1.69/1.89  0 [] e_qual_fruits(X,X).
% 1.69/1.89  0 [] e_qual_boxes(X,X).
% 1.69/1.89  0 [] -label(X,Y)| -contains(X,Y).
% 1.69/1.89  0 [] contains(boxa,X)|contains(boxb,X)|contains(boxc,X).
% 1.69/1.89  0 [] contains(X,apples)|contains(X,bananas)|contains(X,oranges).
% 1.69/1.89  0 [] -contains(X,Y)| -contains(X,Z)|e_qual_fruits(Y,Z).
% 1.69/1.89  0 [] -contains(X,Y)| -contains(Z,Y)|e_qual_boxes(X,Z).
% 1.69/1.89  0 [] -e_qual_boxes(boxa,boxb).
% 1.69/1.89  0 [] -e_qual_boxes(boxb,boxc).
% 1.69/1.89  0 [] -e_qual_boxes(boxa,boxc).
% 1.69/1.89  0 [] -e_qual_fruits(apples,bananas).
% 1.69/1.89  0 [] -e_qual_fruits(bananas,oranges).
% 1.69/1.89  0 [] -e_qual_fruits(apples,oranges).
% 1.69/1.89  0 [] label(boxa,apples).
% 1.69/1.89  0 [] label(boxb,oranges).
% 1.69/1.89  0 [] label(boxc,bananas).
% 1.69/1.89  0 [] contains(boxb,apples).
% 1.69/1.89  0 [] -contains(boxa,bananas)| -contains(boxc,oranges).
% 1.69/1.89  end_of_list.
% 1.69/1.89  
% 1.69/1.89  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.69/1.89  
% 1.69/1.89  This is a non-Horn set without equality.  The strategy will
% 1.69/1.89  be ordered hyper_res, unit deletion, and factoring, with
% 1.69/1.89  satellites in sos and with nuclei in usable.
% 1.69/1.89  
% 1.69/1.89     dependent: set(hyper_res).
% 1.69/1.89     dependent: set(factor).
% 1.69/1.89     dependent: set(unit_deletion).
% 1.69/1.89  
% 1.69/1.89  ------------> process usable:
% 1.69/1.89  ** KEPT (pick-wt=6): 1 [] -label(A,B)| -contains(A,B).
% 1.69/1.89  ** KEPT (pick-wt=9): 2 [] -contains(A,B)| -contains(A,C)|e_qual_fruits(B,C).
% 1.69/1.89  ** KEPT (pick-wt=9): 3 [] -contains(A,B)| -contains(C,B)|e_qual_boxes(A,C).
% 1.69/1.89  ** KEPT (pick-wt=3): 4 [] -e_qual_boxes(boxa,boxb).
% 1.69/1.89  ** KEPT (pick-wt=3): 5 [] -e_qual_boxes(boxb,boxc).
% 1.69/1.89  ** KEPT (pick-wt=3): 6 [] -e_qual_boxes(boxa,boxc).
% 1.69/1.89  ** KEPT (pick-wt=3): 7 [] -e_qual_fruits(apples,bananas).
% 1.69/1.89  ** KEPT (pick-wt=3): 8 [] -e_qual_fruits(bananas,oranges).
% 1.69/1.89  ** KEPT (pick-wt=3): 9 [] -e_qual_fruits(apples,oranges).
% 1.69/1.89  ** KEPT (pick-wt=6): 10 [] -contains(boxa,bananas)| -contains(boxc,oranges).
% 1.69/1.89  
% 1.69/1.89  ------------> process sos:
% 1.69/1.89  ** KEPT (pick-wt=3): 13 [] e_qual_fruits(A,A).
% 1.69/1.89  ** KEPT (pick-wt=3): 14 [] e_qual_boxes(A,A).
% 1.69/1.89  ** KEPT (pick-wt=9): 15 [] contains(boxa,A)|contains(boxb,A)|contains(boxc,A).
% 1.69/1.89  ** KEPT (pick-wt=9): 16 [] contains(A,apples)|contains(A,bananas)|contains(A,oranges).
% 1.69/1.89  ** KEPT (pick-wt=3): 17 [] label(boxa,apples).
% 1.69/1.89  ** KEPT (pick-wt=3): 18 [] label(boxb,oranges).
% 1.69/1.89  ** KEPT (pick-wt=3): 19 [] label(boxc,bananas).
% 1.69/1.89  ** KEPT (pick-wt=3): 20 [] contains(boxb,apples).
% 1.69/1.89  13 back subsumes 11.
% 1.69/1.89  14 back subsumes 12.
% 1.69/1.89  
% 1.69/1.89  ======= end of input processing =======
% 1.69/1.89  
% 1.69/1.89  =========== start of search ===========
% 1.69/1.89  
% 1.69/1.89  -------- PROOF -------- 
% 1.69/1.89  
% 1.69/1.89  ----> UNIT CONFLICT at   0.00 sec ----> 56 [binary,55.1,8.1] $F.
% 1.69/1.89  
% 1.69/1.89  Length of proof is 5.  Level of proof is 4.
% 1.69/1.89  
% 1.69/1.89  ---------------- PROOF ----------------
% 1.69/1.89  % SZS status Unsatisfiable
% 1.69/1.89  % SZS output start Refutation
% See solution above
% 1.69/1.89  ------------ end of proof -------------
% 1.69/1.89  
% 1.69/1.89  
% 1.69/1.89  Search stopped by max_proofs option.
% 1.69/1.89  
% 1.69/1.89  
% 1.69/1.89  Search stopped by max_proofs option.
% 1.69/1.89  
% 1.69/1.89  ============ end of search ============
% 1.69/1.89  
% 1.69/1.89  -------------- statistics -------------
% 1.69/1.89  clauses given                 12
% 1.69/1.89  clauses generated            236
% 1.69/1.89  clauses kept                  55
% 1.69/1.89  clauses forward subsumed     199
% 1.69/1.89  clauses back subsumed         16
% 1.69/1.89  Kbytes malloced              976
% 1.69/1.89  
% 1.69/1.89  ----------- times (seconds) -----------
% 1.69/1.89  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.69/1.89  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.69/1.89  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.69/1.89  
% 1.69/1.89  That finishes the proof of the theorem.
% 1.69/1.89  
% 1.69/1.89  Process 15194 finished Wed Jul 27 02:08:38 2022
% 1.69/1.89  Otter interrupted
% 1.69/1.89  PROOF FOUND
%------------------------------------------------------------------------------