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

View Problem - Process Solution

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

% Computer : n004.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:27 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ big_f(A)
    | ~ big_h(A) ),
    file('SYN060+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ big_g(A)
    | ~ big_h(A) ),
    file('SYN060+1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ big_i(dollar_c1),
    file('SYN060+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( big_g(A)
    | big_h(A) ),
    file('SYN060+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( big_i(A)
    | big_f(A) ),
    file('SYN060+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( big_i(A)
    | big_h(A) ),
    file('SYN060+1.p',unknown),
    [] ).

cnf(8,plain,
    big_f(dollar_c1),
    inference(hyper,[status(thm)],[6,3]),
    [iquote('hyper,6,3')] ).

cnf(9,plain,
    big_g(dollar_c1),
    inference(hyper,[status(thm)],[8,1,5]),
    [iquote('hyper,8,1,5')] ).

cnf(10,plain,
    big_h(dollar_c1),
    inference(hyper,[status(thm)],[7,3]),
    [iquote('hyper,7,3')] ).

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

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