TSTP Solution File: SYN044+1 by Otter---3.3

View Problem - Process Solution

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

% Computer : n006.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:22 EDT 2022

% Result   : Theorem 1.87s 2.06s
% Output   : Refutation 1.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   13 (   3 unt;   5 nHn;  13 RR)
%            Number of literals    :   24 (   0 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    4 (   3 usr;   4 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ q
    | r ),
    file('SYN044+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ r
    | p ),
    file('SYN044+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ r
    | q ),
    file('SYN044+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ p
    | q
    | r ),
    file('SYN044+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ p
    | ~ q ),
    file('SYN044+1.p',unknown),
    [] ).

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

cnf(7,axiom,
    ( p
    | q ),
    file('SYN044+1.p',unknown),
    [] ).

cnf(8,plain,
    ( q
    | p ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[7])]),
    [iquote('copy,7,propositional')] ).

cnf(9,plain,
    ( r
    | p ),
    inference(hyper,[status(thm)],[8,1]),
    [iquote('hyper,8,1')] ).

cnf(10,plain,
    p,
    inference(hyper,[status(thm)],[9,2]),
    [iquote('hyper,9,2')] ).

cnf(11,plain,
    ( q
    | r ),
    inference(hyper,[status(thm)],[10,4]),
    [iquote('hyper,10,4')] ).

cnf(12,plain,
    q,
    inference(hyper,[status(thm)],[11,3]),
    [iquote('hyper,11,3')] ).

cnf(13,plain,
    $false,
    inference(hyper,[status(thm)],[12,6,10]),
    [iquote('hyper,12,6,10')] ).

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