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

View Problem - Process Solution

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

% Computer : n027.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:25 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ big_f(A)
    | ~ big_g(A)
    | ~ big_r(A) ),
    file('SYN055-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ big_p(A)
    | big_f(A) ),
    file('SYN055-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ big_p(A)
    | big_g(A) ),
    file('SYN055-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ big_p(A)
    | big_q(A)
    | big_p(b) ),
    file('SYN055-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ big_p(A)
    | big_q(A)
    | big_r(b) ),
    file('SYN055-1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ big_q(A)
    | ~ big_p(A) ),
    file('SYN055-1.p',unknown),
    [] ).

cnf(7,axiom,
    big_p(a),
    file('SYN055-1.p',unknown),
    [] ).

cnf(8,plain,
    ( big_q(a)
    | big_r(b) ),
    inference(hyper,[status(thm)],[7,5]),
    [iquote('hyper,7,5')] ).

cnf(9,plain,
    ( big_q(a)
    | big_p(b) ),
    inference(hyper,[status(thm)],[7,4]),
    [iquote('hyper,7,4')] ).

cnf(12,plain,
    big_p(b),
    inference(hyper,[status(thm)],[9,6,7]),
    [iquote('hyper,9,6,7')] ).

cnf(14,plain,
    big_g(b),
    inference(hyper,[status(thm)],[12,3]),
    [iquote('hyper,12,3')] ).

cnf(15,plain,
    big_f(b),
    inference(hyper,[status(thm)],[12,2]),
    [iquote('hyper,12,2')] ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN055-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n027.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 11:40:36 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.67/1.89  ----- Otter 3.3f, August 2004 -----
% 1.67/1.89  The process was started by sandbox on n027.cluster.edu,
% 1.67/1.89  Wed Jul 27 11:40:37 2022
% 1.67/1.89  The command was "./otter".  The process ID is 21152.
% 1.67/1.89  
% 1.67/1.89  set(prolog_style_variables).
% 1.67/1.89  set(auto).
% 1.67/1.89     dependent: set(auto1).
% 1.67/1.89     dependent: set(process_input).
% 1.67/1.89     dependent: clear(print_kept).
% 1.67/1.89     dependent: clear(print_new_demod).
% 1.67/1.89     dependent: clear(print_back_demod).
% 1.67/1.89     dependent: clear(print_back_sub).
% 1.67/1.89     dependent: set(control_memory).
% 1.67/1.89     dependent: assign(max_mem, 12000).
% 1.67/1.89     dependent: assign(pick_given_ratio, 4).
% 1.67/1.89     dependent: assign(stats_level, 1).
% 1.67/1.89     dependent: assign(max_seconds, 10800).
% 1.67/1.89  clear(print_given).
% 1.67/1.89  
% 1.67/1.89  list(usable).
% 1.67/1.89  0 [] big_p(a).
% 1.67/1.89  0 [] -big_f(X)| -big_g(X)| -big_r(X).
% 1.67/1.89  0 [] -big_p(X)|big_f(X).
% 1.67/1.89  0 [] -big_p(X)|big_g(X).
% 1.67/1.89  0 [] -big_p(X)|big_q(X)|big_p(b).
% 1.67/1.89  0 [] -big_p(X)|big_q(X)|big_r(b).
% 1.67/1.89  0 [] -big_q(X)| -big_p(X).
% 1.67/1.89  end_of_list.
% 1.67/1.89  
% 1.67/1.89  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.67/1.89  
% 1.67/1.89  This is a non-Horn set without equality.  The strategy will
% 1.67/1.89  be ordered hyper_res, unit deletion, and factoring, with
% 1.67/1.89  satellites in sos and with nuclei in usable.
% 1.67/1.89  
% 1.67/1.89     dependent: set(hyper_res).
% 1.67/1.89     dependent: set(factor).
% 1.67/1.89     dependent: set(unit_deletion).
% 1.67/1.89  
% 1.67/1.89  ------------> process usable:
% 1.67/1.89  ** KEPT (pick-wt=6): 1 [] -big_f(A)| -big_g(A)| -big_r(A).
% 1.67/1.89  ** KEPT (pick-wt=4): 2 [] -big_p(A)|big_f(A).
% 1.67/1.89  ** KEPT (pick-wt=4): 3 [] -big_p(A)|big_g(A).
% 1.67/1.89  ** KEPT (pick-wt=6): 4 [] -big_p(A)|big_q(A)|big_p(b).
% 1.67/1.89  ** KEPT (pick-wt=6): 5 [] -big_p(A)|big_q(A)|big_r(b).
% 1.67/1.89  ** KEPT (pick-wt=4): 6 [] -big_q(A)| -big_p(A).
% 1.67/1.89  
% 1.67/1.89  ------------> process sos:
% 1.67/1.89  ** KEPT (pick-wt=2): 7 [] big_p(a).
% 1.67/1.89  
% 1.67/1.89  ======= end of input processing =======
% 1.67/1.89  
% 1.67/1.89  =========== start of search ===========
% 1.67/1.89  
% 1.67/1.89  -------- PROOF -------- 
% 1.67/1.89  
% 1.67/1.89  -----> EMPTY CLAUSE at   0.00 sec ----> 17 [hyper,16,6,7] $F.
% 1.67/1.89  
% 1.67/1.89  Length of proof is 6.  Level of proof is 4.
% 1.67/1.89  
% 1.67/1.89  ---------------- PROOF ----------------
% 1.67/1.89  % SZS status Unsatisfiable
% 1.67/1.89  % SZS output start Refutation
% See solution above
% 1.67/1.89  ------------ end of proof -------------
% 1.67/1.89  
% 1.67/1.89  
% 1.67/1.89  Search stopped by max_proofs option.
% 1.67/1.89  
% 1.67/1.89  
% 1.67/1.89  Search stopped by max_proofs option.
% 1.67/1.89  
% 1.67/1.89  ============ end of search ============
% 1.67/1.89  
% 1.67/1.89  -------------- statistics -------------
% 1.67/1.89  clauses given                  9
% 1.67/1.89  clauses generated             10
% 1.67/1.89  clauses kept                  16
% 1.67/1.89  clauses forward subsumed       0
% 1.67/1.89  clauses back subsumed          3
% 1.67/1.89  Kbytes malloced              976
% 1.67/1.89  
% 1.67/1.89  ----------- times (seconds) -----------
% 1.67/1.89  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.67/1.89  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.67/1.89  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.67/1.89  
% 1.67/1.89  That finishes the proof of the theorem.
% 1.67/1.89  
% 1.67/1.89  Process 21152 finished Wed Jul 27 11:40:38 2022
% 1.67/1.89  Otter interrupted
% 1.67/1.89  PROOF FOUND
%------------------------------------------------------------------------------