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

View Problem - Process Solution

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

% Computer : n023.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:06:17 EDT 2022

% Result   : Unsatisfiable 1.96s 2.17s
% Output   : Refutation 1.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   23 (  14 unt;   2 nHn;  12 RR)
%            Number of literals    :   36 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   45 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ~ hold(thing(A),do(let_go,B)),
    file('MSC001-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ at(thing(A),B,do(go(B),C))
    | at(thing(A),B,C)
    | hold(thing(A),C) ),
    file('MSC001-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ at(hand,A,B)
    | ~ at(thing(C),A,B)
    | hold(thing(taken(B)),do(pick_up,B)) ),
    file('MSC001-1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ hold(thing(A),B)
    | ~ at(hand,C,B)
    | at(thing(A),C,B) ),
    file('MSC001-1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ red(A)
    | ~ at(A,there,B)
    | answer(B) ),
    file('MSC001-1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ hold(thing(A),B)
    | hold(thing(A),do(go(C),B)) ),
    file('MSC001-1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ at(hand,A,B)
    | at(thing(taken(B)),A,B) ),
    file('MSC001-1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ at(A,B,do(let_go,C))
    | at(A,B,C) ),
    file('MSC001-1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ at(A,here,now)
    | red(A) ),
    file('MSC001-1.p',unknown),
    [] ).

cnf(16,axiom,
    ~ answer(A),
    file('MSC001-1.p',unknown),
    [] ).

cnf(17,axiom,
    at(hand,A,do(go(A),B)),
    file('MSC001-1.p',unknown),
    [] ).

cnf(21,plain,
    at(thing(taken(do(go(A),B))),A,do(go(A),B)),
    inference(hyper,[status(thm)],[17,11]),
    [iquote('hyper,17,11')] ).

cnf(51,plain,
    hold(thing(taken(do(go(A),B))),do(pick_up,do(go(A),B))),
    inference(hyper,[status(thm)],[21,5,17]),
    [iquote('hyper,21,5,17')] ).

cnf(52,plain,
    ( at(thing(taken(do(go(A),B))),A,B)
    | hold(thing(taken(do(go(A),B))),B) ),
    inference(hyper,[status(thm)],[21,4]),
    [iquote('hyper,21,4')] ).

cnf(170,plain,
    hold(thing(taken(do(go(A),B))),do(go(C),do(pick_up,do(go(A),B)))),
    inference(hyper,[status(thm)],[51,10]),
    [iquote('hyper,51,10')] ).

cnf(185,plain,
    at(thing(taken(do(go(A),do(let_go,B)))),A,do(let_go,B)),
    inference(hyper,[status(thm)],[52,2]),
    [iquote('hyper,52,2')] ).

cnf(306,plain,
    at(thing(taken(do(go(A),do(let_go,B)))),A,B),
    inference(hyper,[status(thm)],[185,14]),
    [iquote('hyper,185,14')] ).

cnf(315,plain,
    at(thing(taken(do(go(A),do(let_go,do(let_go,B))))),A,B),
    inference(hyper,[status(thm)],[306,14]),
    [iquote('hyper,306,14')] ).

cnf(325,plain,
    at(thing(taken(do(go(A),do(let_go,do(let_go,do(let_go,B)))))),A,B),
    inference(hyper,[status(thm)],[315,14]),
    [iquote('hyper,315,14')] ).

cnf(622,plain,
    at(thing(taken(do(go(A),B))),C,do(go(C),do(pick_up,do(go(A),B)))),
    inference(hyper,[status(thm)],[170,6,17]),
    [iquote('hyper,170,6,17')] ).

cnf(764,plain,
    red(thing(taken(do(go(here),do(let_go,do(let_go,do(let_go,now))))))),
    inference(hyper,[status(thm)],[325,15]),
    [iquote('hyper,325,15')] ).

cnf(1842,plain,
    answer(do(go(there),do(pick_up,do(go(here),do(let_go,do(let_go,do(let_go,now))))))),
    inference(hyper,[status(thm)],[622,8,764]),
    [iquote('hyper,622,8,764')] ).

cnf(1843,plain,
    $false,
    inference(binary,[status(thm)],[1842,16]),
    [iquote('binary,1842.1,16.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : MSC001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n023.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 09:21:03 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.96/2.17  ----- Otter 3.3f, August 2004 -----
% 1.96/2.17  The process was started by sandbox on n023.cluster.edu,
% 1.96/2.17  Wed Jul 27 09:21:03 2022
% 1.96/2.17  The command was "./otter".  The process ID is 4327.
% 1.96/2.17  
% 1.96/2.17  set(prolog_style_variables).
% 1.96/2.17  set(auto).
% 1.96/2.17     dependent: set(auto1).
% 1.96/2.17     dependent: set(process_input).
% 1.96/2.17     dependent: clear(print_kept).
% 1.96/2.17     dependent: clear(print_new_demod).
% 1.96/2.17     dependent: clear(print_back_demod).
% 1.96/2.17     dependent: clear(print_back_sub).
% 1.96/2.17     dependent: set(control_memory).
% 1.96/2.17     dependent: assign(max_mem, 12000).
% 1.96/2.17     dependent: assign(pick_given_ratio, 4).
% 1.96/2.17     dependent: assign(stats_level, 1).
% 1.96/2.17     dependent: assign(max_seconds, 10800).
% 1.96/2.17  clear(print_given).
% 1.96/2.17  
% 1.96/2.17  list(usable).
% 1.96/2.17  0 [] -at(A,there,B)| -at(A,here,B).
% 1.96/2.17  0 [] -hold(thing(A),do(let_go,B)).
% 1.96/2.17  0 [] -red(hand).
% 1.96/2.17  0 [] at(hand,A,do(go(A),B)).
% 1.96/2.17  0 [] at(thing(s),here,now).
% 1.96/2.17  0 [] -at(thing(A),B,do(go(B),C))|at(thing(A),B,C)|hold(thing(A),C).
% 1.96/2.17  0 [] -at(hand,A,B)| -at(thing(C),A,B)|hold(thing(taken(B)),do(pick_up,B)).
% 1.96/2.17  0 [] -hold(thing(A),B)| -at(hand,C,B)|at(thing(A),C,B).
% 1.96/2.17  0 [] -hold(thing(A),B)| -at(thing(A),C,B)|at(hand,C,B).
% 1.96/2.17  0 [] -red(A)| -at(A,there,B)|answer(B).
% 1.96/2.17  0 [] -at(thing(A),B,C)|at(thing(A),B,do(go(B),C)).
% 1.96/2.17  0 [] -hold(thing(A),B)|hold(thing(A),do(go(C),B)).
% 1.96/2.17  0 [] -at(hand,A,B)|at(thing(taken(B)),A,B).
% 1.96/2.17  0 [] -at(A,B,C)|at(A,B,do(pick_up,C)).
% 1.96/2.17  0 [] -at(A,B,C)|at(A,B,do(let_go,C)).
% 1.96/2.17  0 [] -at(A,B,do(let_go,C))|at(A,B,C).
% 1.96/2.17  0 [] -at(A,here,now)|red(A).
% 1.96/2.17  0 [] -answer(A).
% 1.96/2.17  end_of_list.
% 1.96/2.17  
% 1.96/2.17  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.96/2.17  
% 1.96/2.17  This is a non-Horn set without equality.  The strategy will
% 1.96/2.17  be ordered hyper_res, unit deletion, and factoring, with
% 1.96/2.17  satellites in sos and with nuclei in usable.
% 1.96/2.17  
% 1.96/2.17     dependent: set(hyper_res).
% 1.96/2.17     dependent: set(factor).
% 1.96/2.17     dependent: set(unit_deletion).
% 1.96/2.17  
% 1.96/2.17  ------------> process usable:
% 1.96/2.17  ** KEPT (pick-wt=8): 1 [] -at(A,there,B)| -at(A,here,B).
% 1.96/2.17  ** KEPT (pick-wt=6): 2 [] -hold(thing(A),do(let_go,B)).
% 1.96/2.17  ** KEPT (pick-wt=2): 3 [] -red(hand).
% 1.96/2.17  ** KEPT (pick-wt=17): 4 [] -at(thing(A),B,do(go(B),C))|at(thing(A),B,C)|hold(thing(A),C).
% 1.96/2.17  ** KEPT (pick-wt=16): 5 [] -at(hand,A,B)| -at(thing(C),A,B)|hold(thing(taken(B)),do(pick_up,B)).
% 1.96/2.17  ** KEPT (pick-wt=13): 6 [] -hold(thing(A),B)| -at(hand,C,B)|at(thing(A),C,B).
% 1.96/2.17  ** KEPT (pick-wt=13): 7 [] -hold(thing(A),B)| -at(thing(A),C,B)|at(hand,C,B).
% 1.96/2.17  ** KEPT (pick-wt=8): 8 [] -red(A)| -at(A,there,B)|answer(B).
% 1.96/2.17  ** KEPT (pick-wt=13): 9 [] -at(thing(A),B,C)|at(thing(A),B,do(go(B),C)).
% 1.96/2.17  ** KEPT (pick-wt=11): 10 [] -hold(thing(A),B)|hold(thing(A),do(go(C),B)).
% 1.96/2.17  ** KEPT (pick-wt=10): 11 [] -at(hand,A,B)|at(thing(taken(B)),A,B).
% 1.96/2.17  ** KEPT (pick-wt=10): 12 [] -at(A,B,C)|at(A,B,do(pick_up,C)).
% 1.96/2.17  ** KEPT (pick-wt=10): 13 [] -at(A,B,C)|at(A,B,do(let_go,C)).
% 1.96/2.17  ** KEPT (pick-wt=10): 14 [] -at(A,B,do(let_go,C))|at(A,B,C).
% 1.96/2.17  ** KEPT (pick-wt=6): 15 [] -at(A,here,now)|red(A).
% 1.96/2.17  ** KEPT (pick-wt=2): 16 [] -answer(A).
% 1.96/2.17  
% 1.96/2.17  ------------> process sos:
% 1.96/2.17  ** KEPT (pick-wt=7): 17 [] at(hand,A,do(go(A),B)).
% 1.96/2.17  ** KEPT (pick-wt=5): 18 [] at(thing(s),here,now).
% 1.96/2.17  
% 1.96/2.17  ======= end of input processing =======
% 1.96/2.17  
% 1.96/2.17  =========== start of search ===========
% 1.96/2.17  
% 1.96/2.17  -------- PROOF -------- 
% 1.96/2.17  
% 1.96/2.17  ----> UNIT CONFLICT at   0.06 sec ----> 1843 [binary,1842.1,16.1] $F.
% 1.96/2.17  
% 1.96/2.17  Length of proof is 11.  Level of proof is 8.
% 1.96/2.17  
% 1.96/2.17  ---------------- PROOF ----------------
% 1.96/2.17  % SZS status Unsatisfiable
% 1.96/2.17  % SZS output start Refutation
% See solution above
% 1.96/2.17  ------------ end of proof -------------
% 1.96/2.17  
% 1.96/2.17  
% 1.96/2.17  Search stopped by max_proofs option.
% 1.96/2.17  
% 1.96/2.17  
% 1.96/2.17  Search stopped by max_proofs option.
% 1.96/2.17  
% 1.96/2.17  ============ end of search ============
% 1.96/2.17  
% 1.96/2.17  -------------- statistics -------------
% 1.96/2.17  clauses given                498
% 1.96/2.17  clauses generated           3093
% 1.96/2.17  clauses kept                1842
% 1.96/2.17  clauses forward subsumed    1269
% 1.96/2.17  clauses back subsumed         67
% 1.96/2.17  Kbytes malloced             1953
% 1.96/2.17  
% 1.96/2.17  ----------- times (seconds) -----------
% 1.96/2.17  user CPU time          0.07          (0 hr, 0 min, 0 sec)
% 1.96/2.17  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 1.96/2.17  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.96/2.17  
% 1.96/2.17  That finishes the proof of the theorem.
% 1.96/2.17  
% 1.96/2.17  Process 4327 finished Wed Jul 27 09:21:05 2022
% 1.96/2.17  Otter interrupted
% 1.96/2.17  PROOF FOUND
%------------------------------------------------------------------------------