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

View Problem - Process Solution

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

% Computer : n011.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:23:20 EDT 2022

% Result   : Unsatisfiable 1.96s 2.13s
% Output   : Refutation 1.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   18 (   3 unt;   9 nHn;  18 RR)
%            Number of literals    :   39 (   0 equ;  12 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    7 (   6 usr;   7 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( h
    | a
    | ~ j ),
    file('SYN032-1.p',unknown),
    [] ).

cnf(2,plain,
    ( ~ j
    | h
    | a ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[1])]),
    [iquote('copy,1,propositional')] ).

cnf(3,axiom,
    ( h
    | j
    | ~ k ),
    file('SYN032-1.p',unknown),
    [] ).

cnf(4,plain,
    ( ~ k
    | h
    | j ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[3])]),
    [iquote('copy,3,propositional')] ).

cnf(5,axiom,
    ( b
    | ~ a ),
    file('SYN032-1.p',unknown),
    [] ).

cnf(6,plain,
    ( ~ a
    | b ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[5])]),
    [iquote('copy,5,propositional')] ).

cnf(7,axiom,
    ( c
    | ~ h ),
    file('SYN032-1.p',unknown),
    [] ).

cnf(8,plain,
    ( ~ h
    | c ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[7])]),
    [iquote('copy,7,propositional')] ).

cnf(9,axiom,
    ( ~ h
    | ~ c ),
    file('SYN032-1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ a
    | ~ b ),
    file('SYN032-1.p',unknown),
    [] ).

cnf(11,axiom,
    ( h
    | k
    | j ),
    file('SYN032-1.p',unknown),
    [] ).

cnf(12,plain,
    ( h
    | j
    | k ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[11])]),
    [iquote('copy,11,propositional')] ).

cnf(13,plain,
    ( h
    | j ),
    inference(hyper,[status(thm)],[12,4]),
    [iquote('hyper,12,4')] ).

cnf(14,plain,
    ( h
    | a ),
    inference(hyper,[status(thm)],[13,2]),
    [iquote('hyper,13,2')] ).

cnf(15,plain,
    ( a
    | c ),
    inference(hyper,[status(thm)],[14,8]),
    [iquote('hyper,14,8')] ).

cnf(16,plain,
    a,
    inference(hyper,[status(thm)],[15,9,14]),
    [iquote('hyper,15,9,14')] ).

cnf(17,plain,
    b,
    inference(hyper,[status(thm)],[16,6]),
    [iquote('hyper,16,6')] ).

cnf(18,plain,
    $false,
    inference(hyper,[status(thm)],[17,10,16]),
    [iquote('hyper,17,10,16')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN032-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n011.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 10:56:25 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.96/2.13  ----- Otter 3.3f, August 2004 -----
% 1.96/2.13  The process was started by sandbox on n011.cluster.edu,
% 1.96/2.13  Wed Jul 27 10:56:25 2022
% 1.96/2.13  The command was "./otter".  The process ID is 12292.
% 1.96/2.13  
% 1.96/2.13  set(prolog_style_variables).
% 1.96/2.13  set(auto).
% 1.96/2.13     dependent: set(auto1).
% 1.96/2.13     dependent: set(process_input).
% 1.96/2.13     dependent: clear(print_kept).
% 1.96/2.13     dependent: clear(print_new_demod).
% 1.96/2.13     dependent: clear(print_back_demod).
% 1.96/2.13     dependent: clear(print_back_sub).
% 1.96/2.13     dependent: set(control_memory).
% 1.96/2.13     dependent: assign(max_mem, 12000).
% 1.96/2.13     dependent: assign(pick_given_ratio, 4).
% 1.96/2.13     dependent: assign(stats_level, 1).
% 1.96/2.13     dependent: assign(max_seconds, 10800).
% 1.96/2.13  clear(print_given).
% 1.96/2.13  
% 1.96/2.13  list(usable).
% 1.96/2.13  0 [] h|a| -j.
% 1.96/2.13  0 [] h|k|j.
% 1.96/2.13  0 [] h|j| -k.
% 1.96/2.13  0 [] b| -a.
% 1.96/2.13  0 [] c| -h.
% 1.96/2.13  0 [] -h| -c.
% 1.96/2.13  0 [] -a| -b.
% 1.96/2.13  end_of_list.
% 1.96/2.13  
% 1.96/2.13  SCAN INPUT: prop=1, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.96/2.13  
% 1.96/2.13  The clause set is propositional; the strategy will be
% 1.96/2.13  ordered hyperresolution with the propositional
% 1.96/2.13  optimizations, with satellites in sos and nuclei in usable.
% 1.96/2.13  
% 1.96/2.13     dependent: set(hyper_res).
% 1.96/2.13     dependent: set(propositional).
% 1.96/2.13     dependent: set(sort_literals).
% 1.96/2.13  
% 1.96/2.13  ------------> process usable:
% 1.96/2.13  ** KEPT (pick-wt=3): 2 [copy,1,propositional] -j|h|a.
% 1.96/2.13  ** KEPT (pick-wt=3): 4 [copy,3,propositional] -k|h|j.
% 1.96/2.13  ** KEPT (pick-wt=2): 6 [copy,5,propositional] -a|b.
% 1.96/2.13  ** KEPT (pick-wt=2): 8 [copy,7,propositional] -h|c.
% 1.96/2.13  ** KEPT (pick-wt=2): 9 [] -h| -c.
% 1.96/2.13  ** KEPT (pick-wt=2): 10 [] -a| -b.
% 1.96/2.13  
% 1.96/2.13  ------------> process sos:
% 1.96/2.13  ** KEPT (pick-wt=3): 12 [copy,11,propositional] h|j|k.
% 1.96/2.13  
% 1.96/2.13  ======= end of input processing =======
% 1.96/2.13  
% 1.96/2.13  =========== start of search ===========
% 1.96/2.13  
% 1.96/2.13  -------- PROOF -------- 
% 1.96/2.13  
% 1.96/2.13  -----> EMPTY CLAUSE at   0.00 sec ----> 18 [hyper,17,10,16] $F.
% 1.96/2.13  
% 1.96/2.13  Length of proof is 10.  Level of proof is 6.
% 1.96/2.13  
% 1.96/2.13  ---------------- PROOF ----------------
% 1.96/2.13  % SZS status Unsatisfiable
% 1.96/2.13  % SZS output start Refutation
% See solution above
% 1.96/2.13  ------------ end of proof -------------
% 1.96/2.13  
% 1.96/2.13  
% 1.96/2.13  Search stopped by max_proofs option.
% 1.96/2.13  
% 1.96/2.13  
% 1.96/2.13  Search stopped by max_proofs option.
% 1.96/2.13  
% 1.96/2.13  ============ end of search ============
% 1.96/2.13  
% 1.96/2.13  -------------- statistics -------------
% 1.96/2.13  clauses given                  6
% 1.96/2.13  clauses generated              6
% 1.96/2.13  clauses kept                  12
% 1.96/2.13  clauses forward subsumed       0
% 1.96/2.13  clauses back subsumed          6
% 1.96/2.13  Kbytes malloced              976
% 1.96/2.13  
% 1.96/2.13  ----------- times (seconds) -----------
% 1.96/2.13  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.96/2.13  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.96/2.13  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.96/2.13  
% 1.96/2.13  That finishes the proof of the theorem.
% 1.96/2.13  
% 1.96/2.13  Process 12292 finished Wed Jul 27 10:56:27 2022
% 1.96/2.13  Otter interrupted
% 1.96/2.13  PROOF FOUND
%------------------------------------------------------------------------------