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

View Problem - Process Solution

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

% Computer : n009.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:18 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ n
    | ~ t ),
    file('SYN011-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( l
    | ~ m ),
    file('SYN011-1.p',unknown),
    [] ).

cnf(3,plain,
    ( ~ m
    | l ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[2])]),
    [iquote('copy,2,propositional')] ).

cnf(4,axiom,
    ( l
    | ~ q ),
    file('SYN011-1.p',unknown),
    [] ).

cnf(5,plain,
    ( ~ q
    | l ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[4])]),
    [iquote('copy,4,propositional')] ).

cnf(6,axiom,
    ( ~ l
    | ~ p ),
    file('SYN011-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ r
    | ~ l ),
    file('SYN011-1.p',unknown),
    [] ).

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

cnf(9,axiom,
    ( m
    | q
    | n ),
    file('SYN011-1.p',unknown),
    [] ).

cnf(10,plain,
    ( n
    | m
    | q ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[9])]),
    [iquote('copy,9,propositional')] ).

cnf(11,axiom,
    ( r
    | p
    | n ),
    file('SYN011-1.p',unknown),
    [] ).

cnf(12,plain,
    ( n
    | p
    | r ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[11])]),
    [iquote('copy,11,propositional')] ).

cnf(13,axiom,
    t,
    file('SYN011-1.p',unknown),
    [] ).

cnf(14,plain,
    ( n
    | m
    | l ),
    inference(hyper,[status(thm)],[10,5]),
    [iquote('hyper,10,5')] ).

cnf(15,plain,
    ( m
    | l ),
    inference(hyper,[status(thm)],[14,1,13]),
    [iquote('hyper,14,1,13')] ).

cnf(16,plain,
    l,
    inference(hyper,[status(thm)],[15,3]),
    [iquote('hyper,15,3')] ).

cnf(17,plain,
    ( n
    | p ),
    inference(hyper,[status(thm)],[16,8,12]),
    [iquote('hyper,16,8,12')] ).

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

cnf(19,plain,
    $false,
    inference(hyper,[status(thm)],[18,1,13]),
    [iquote('hyper,18,1,13')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN011-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Wed Jul 27 11:11:51 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.68/1.89  ----- Otter 3.3f, August 2004 -----
% 1.68/1.89  The process was started by sandbox2 on n009.cluster.edu,
% 1.68/1.89  Wed Jul 27 11:11:51 2022
% 1.68/1.89  The command was "./otter".  The process ID is 15874.
% 1.68/1.89  
% 1.68/1.89  set(prolog_style_variables).
% 1.68/1.89  set(auto).
% 1.68/1.89     dependent: set(auto1).
% 1.68/1.89     dependent: set(process_input).
% 1.68/1.89     dependent: clear(print_kept).
% 1.68/1.89     dependent: clear(print_new_demod).
% 1.68/1.89     dependent: clear(print_back_demod).
% 1.68/1.89     dependent: clear(print_back_sub).
% 1.68/1.89     dependent: set(control_memory).
% 1.68/1.89     dependent: assign(max_mem, 12000).
% 1.68/1.89     dependent: assign(pick_given_ratio, 4).
% 1.68/1.89     dependent: assign(stats_level, 1).
% 1.68/1.89     dependent: assign(max_seconds, 10800).
% 1.68/1.89  clear(print_given).
% 1.68/1.89  
% 1.68/1.89  list(usable).
% 1.68/1.89  0 [] -n| -t.
% 1.68/1.89  0 [] m|q|n.
% 1.68/1.89  0 [] l| -m.
% 1.68/1.89  0 [] l| -q.
% 1.68/1.89  0 [] -l| -p.
% 1.68/1.89  0 [] r|p|n.
% 1.68/1.89  0 [] -r| -l.
% 1.68/1.89  0 [] t.
% 1.68/1.89  end_of_list.
% 1.68/1.89  
% 1.68/1.89  SCAN INPUT: prop=1, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.68/1.89  
% 1.68/1.89  The clause set is propositional; the strategy will be
% 1.68/1.89  ordered hyperresolution with the propositional
% 1.68/1.89  optimizations, with satellites in sos and nuclei in usable.
% 1.68/1.89  
% 1.68/1.89     dependent: set(hyper_res).
% 1.68/1.89     dependent: set(propositional).
% 1.68/1.89     dependent: set(sort_literals).
% 1.68/1.89  
% 1.68/1.89  ------------> process usable:
% 1.68/1.89  ** KEPT (pick-wt=2): 1 [] -n| -t.
% 1.68/1.89  ** KEPT (pick-wt=2): 3 [copy,2,propositional] -m|l.
% 1.68/1.89  ** KEPT (pick-wt=2): 5 [copy,4,propositional] -q|l.
% 1.68/1.89  ** KEPT (pick-wt=2): 6 [] -l| -p.
% 1.68/1.89  ** KEPT (pick-wt=2): 8 [copy,7,propositional] -l| -r.
% 1.68/1.89  
% 1.68/1.89  ------------> process sos:
% 1.68/1.89  ** KEPT (pick-wt=3): 10 [copy,9,propositional] n|m|q.
% 1.68/1.89  ** KEPT (pick-wt=3): 12 [copy,11,propositional] n|p|r.
% 1.68/1.89  ** KEPT (pick-wt=1): 13 [] t.
% 1.68/1.89  
% 1.68/1.89  ======= end of input processing =======
% 1.68/1.89  
% 1.68/1.89  =========== start of search ===========
% 1.68/1.89  
% 1.68/1.89  -------- PROOF -------- 
% 1.68/1.89  
% 1.68/1.89  -----> EMPTY CLAUSE at   0.00 sec ----> 19 [hyper,18,1,13] $F.
% 1.68/1.89  
% 1.68/1.89  Length of proof is 10.  Level of proof is 6.
% 1.68/1.89  
% 1.68/1.89  ---------------- PROOF ----------------
% 1.68/1.89  % SZS status Unsatisfiable
% 1.68/1.89  % SZS output start Refutation
% See solution above
% 1.68/1.89  ------------ end of proof -------------
% 1.68/1.89  
% 1.68/1.89  
% 1.68/1.89  Search stopped by max_proofs option.
% 1.68/1.89  
% 1.68/1.89  
% 1.68/1.89  Search stopped by max_proofs option.
% 1.68/1.89  
% 1.68/1.89  ============ end of search ============
% 1.68/1.89  
% 1.68/1.89  -------------- statistics -------------
% 1.68/1.89  clauses given                  8
% 1.68/1.89  clauses generated              6
% 1.68/1.89  clauses kept                  13
% 1.68/1.89  clauses forward subsumed       0
% 1.68/1.89  clauses back subsumed          7
% 1.68/1.89  Kbytes malloced              976
% 1.68/1.89  
% 1.68/1.89  ----------- times (seconds) -----------
% 1.68/1.89  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.68/1.89  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.68/1.89  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.68/1.89  
% 1.68/1.89  That finishes the proof of the theorem.
% 1.68/1.89  
% 1.68/1.89  Process 15874 finished Wed Jul 27 11:11:52 2022
% 1.68/1.89  Otter interrupted
% 1.68/1.89  PROOF FOUND
%------------------------------------------------------------------------------