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

View Problem - Process Solution

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

% Computer : n014.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.68s 1.87s
% Output   : Refutation 1.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   11 (   4 unt;   4 nHn;  11 RR)
%            Number of literals    :   19 (   0 equ;   6 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ big_s(A)
    | ~ big_q(A) ),
    file('SYN054-1.p',unknown),
    [] ).

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

cnf(3,axiom,
    ( ~ big_q(A)
    | big_s(A) ),
    file('SYN054-1.p',unknown),
    [] ).

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

cnf(6,axiom,
    ( big_p(a)
    | big_q(b) ),
    file('SYN054-1.p',unknown),
    [] ).

cnf(7,plain,
    ( big_p(a)
    | big_s(b) ),
    inference(hyper,[status(thm)],[6,3]),
    [iquote('hyper,6,3')] ).

cnf(8,plain,
    big_p(a),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[7,1,6])]),
    [iquote('hyper,7,1,6,factor_simp')] ).

cnf(9,plain,
    ( big_q(a)
    | big_r(a) ),
    inference(hyper,[status(thm)],[8,2]),
    [iquote('hyper,8,2')] ).

cnf(10,plain,
    big_q(a),
    inference(hyper,[status(thm)],[9,5,8]),
    [iquote('hyper,9,5,8')] ).

cnf(11,plain,
    big_s(a),
    inference(hyper,[status(thm)],[10,3]),
    [iquote('hyper,10,3')] ).

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

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