↑ Up

Otter---3.3.UNS-Ref.s

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

% Computer : n015.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 12:55:40 EDT 2022

% Result   : Unsatisfiable 1.94s 2.12s
% Output   : Refutation 1.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   30 (   3 unt;  21 nHn;  30 RR)
%            Number of literals    :   71 (   0 equ;  21 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    6 (   5 usr;   6 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn)

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

cnf(2,axiom,
    ( a
    | c
    | ~ d ),
    file('GRA001-1.p',unknown),
    [] ).

cnf(3,plain,
    ( ~ d
    | a
    | c ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[2])]),
    [iquote('copy,2,propositional')] ).

cnf(4,axiom,
    ( a
    | ~ c
    | d ),
    file('GRA001-1.p',unknown),
    [] ).

cnf(5,plain,
    ( ~ c
    | a
    | d ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[4])]),
    [iquote('copy,4,propositional')] ).

cnf(6,axiom,
    ( ~ a
    | c
    | d ),
    file('GRA001-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ a
    | ~ c
    | ~ d ),
    file('GRA001-1.p',unknown),
    [] ).

cnf(8,axiom,
    ( b
    | c
    | ~ e ),
    file('GRA001-1.p',unknown),
    [] ).

cnf(9,plain,
    ( ~ e
    | b
    | c ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[8])]),
    [iquote('copy,8,propositional')] ).

cnf(10,axiom,
    ( b
    | ~ c
    | e ),
    file('GRA001-1.p',unknown),
    [] ).

cnf(11,plain,
    ( ~ c
    | b
    | e ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[10])]),
    [iquote('copy,10,propositional')] ).

cnf(12,axiom,
    ( ~ b
    | c
    | e ),
    file('GRA001-1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ b
    | ~ c
    | ~ e ),
    file('GRA001-1.p',unknown),
    [] ).

cnf(14,axiom,
    ( d
    | ~ e ),
    file('GRA001-1.p',unknown),
    [] ).

cnf(15,plain,
    ( ~ e
    | d ),
    inference(propositional,[status(thm)],[inference(copy,[status(thm)],[14])]),
    [iquote('copy,14,propositional')] ).

cnf(16,axiom,
    ( ~ d
    | e ),
    file('GRA001-1.p',unknown),
    [] ).

cnf(17,axiom,
    ( a
    | b ),
    file('GRA001-1.p',unknown),
    [] ).

cnf(18,plain,
    ( a
    | c
    | e ),
    inference(hyper,[status(thm)],[17,12]),
    [iquote('hyper,17,12')] ).

cnf(19,plain,
    ( a
    | c
    | d ),
    inference(hyper,[status(thm)],[18,15]),
    [iquote('hyper,18,15')] ).

cnf(20,plain,
    ( a
    | c ),
    inference(hyper,[status(thm)],[19,3]),
    [iquote('hyper,19,3')] ).

cnf(21,plain,
    ( a
    | d ),
    inference(hyper,[status(thm)],[20,5]),
    [iquote('hyper,20,5')] ).

cnf(22,plain,
    ( a
    | e ),
    inference(hyper,[status(thm)],[21,16]),
    [iquote('hyper,21,16')] ).

cnf(23,plain,
    a,
    inference(hyper,[status(thm)],[22,13,17,20]),
    [iquote('hyper,22,13,17,20')] ).

cnf(24,plain,
    ( c
    | d ),
    inference(hyper,[status(thm)],[23,6]),
    [iquote('hyper,23,6')] ).

cnf(25,plain,
    ( c
    | e ),
    inference(hyper,[status(thm)],[24,16]),
    [iquote('hyper,24,16')] ).

cnf(26,plain,
    ( b
    | c ),
    inference(hyper,[status(thm)],[25,9]),
    [iquote('hyper,25,9')] ).

cnf(27,plain,
    ( b
    | e ),
    inference(hyper,[status(thm)],[26,11]),
    [iquote('hyper,26,11')] ).

cnf(28,plain,
    ( b
    | d ),
    inference(hyper,[status(thm)],[27,15]),
    [iquote('hyper,27,15')] ).

cnf(29,plain,
    b,
    inference(hyper,[status(thm)],[28,7,23,26]),
    [iquote('hyper,28,7,23,26')] ).

cnf(30,plain,
    $false,
    inference(hyper,[status(thm)],[29,1,23]),
    [iquote('hyper,29,1,23')] ).

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