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

View Problem - Process Solution

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

% Computer : n005.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:24:13 EDT 2022

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

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

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

cnf(6,axiom,
    ~ big_h(dollar_f1(A,B)),
    file('SYN319+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( big_f(A)
    | big_g(B) ),
    file('SYN319+1.p',unknown),
    [] ).

cnf(8,plain,
    ( big_f(A)
    | big_h(B) ),
    inference(hyper,[status(thm)],[7,5]),
    [iquote('hyper,7,5')] ).

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

cnf(10,plain,
    big_h(A),
    inference(hyper,[status(thm)],[9,4]),
    [iquote('hyper,9,4')] ).

cnf(11,plain,
    $false,
    inference(binary,[status(thm)],[10,6]),
    [iquote('binary,10.1,6.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN319+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 11:12:05 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.62/1.80  ----- Otter 3.3f, August 2004 -----
% 1.62/1.80  The process was started by sandbox on n005.cluster.edu,
% 1.62/1.80  Wed Jul 27 11:12:05 2022
% 1.62/1.80  The command was "./otter".  The process ID is 2071.
% 1.62/1.80  
% 1.62/1.80  set(prolog_style_variables).
% 1.62/1.80  set(auto).
% 1.62/1.80     dependent: set(auto1).
% 1.62/1.80     dependent: set(process_input).
% 1.62/1.80     dependent: clear(print_kept).
% 1.62/1.80     dependent: clear(print_new_demod).
% 1.62/1.80     dependent: clear(print_back_demod).
% 1.62/1.80     dependent: clear(print_back_sub).
% 1.62/1.80     dependent: set(control_memory).
% 1.62/1.80     dependent: assign(max_mem, 12000).
% 1.62/1.80     dependent: assign(pick_given_ratio, 4).
% 1.62/1.80     dependent: assign(stats_level, 1).
% 1.62/1.80     dependent: assign(max_seconds, 10800).
% 1.62/1.80  clear(print_given).
% 1.62/1.80  
% 1.62/1.80  formula_list(usable).
% 1.62/1.80  -(exists X Y all Z1 Z2 (((big_f(Y)->big_g(Z1))->big_g(X)& -big_f(Z1))-> ((big_f(X)|big_g(X)->big_h(X))->big_h(Z2)& (big_h(Y)-> (big_f(Z2)|big_g(Z2)->big_h(Z2)))))).
% 1.62/1.80  end_of_list.
% 1.62/1.80  
% 1.62/1.80  -------> usable clausifies to:
% 1.62/1.80  
% 1.62/1.80  list(usable).
% 1.62/1.80  0 [] big_f(Y)|big_g(X).
% 1.62/1.80  0 [] big_f(Y)| -big_f($f2(X,Y)).
% 1.62/1.80  0 [] -big_g($f2(X,Y))|big_g(X).
% 1.62/1.80  0 [] -big_g($f2(X,Y))| -big_f($f2(X,Y)).
% 1.62/1.80  0 [] -big_f(X)|big_h(X).
% 1.62/1.80  0 [] -big_g(X)|big_h(X).
% 1.62/1.80  0 [] -big_h($f1(X,Y)).
% 1.62/1.80  end_of_list.
% 1.62/1.80  
% 1.62/1.80  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.62/1.80  
% 1.62/1.80  This is a non-Horn set without equality.  The strategy will
% 1.62/1.80  be ordered hyper_res, unit deletion, and factoring, with
% 1.62/1.80  satellites in sos and with nuclei in usable.
% 1.62/1.80  
% 1.62/1.80     dependent: set(hyper_res).
% 1.62/1.80     dependent: set(factor).
% 1.62/1.80     dependent: set(unit_deletion).
% 1.62/1.80  
% 1.62/1.80  ------------> process usable:
% 1.62/1.80  ** KEPT (pick-wt=6): 1 [] big_f(A)| -big_f($f2(B,A)).
% 1.62/1.80  ** KEPT (pick-wt=6): 2 [] -big_g($f2(A,B))|big_g(A).
% 1.62/1.80  ** KEPT (pick-wt=8): 3 [] -big_g($f2(A,B))| -big_f($f2(A,B)).
% 1.62/1.80  ** KEPT (pick-wt=4): 4 [] -big_f(A)|big_h(A).
% 1.62/1.80  ** KEPT (pick-wt=4): 5 [] -big_g(A)|big_h(A).
% 1.62/1.80  ** KEPT (pick-wt=4): 6 [] -big_h($f1(A,B)).
% 1.62/1.80  
% 1.62/1.80  ------------> process sos:
% 1.62/1.80  ** KEPT (pick-wt=4): 7 [] big_f(A)|big_g(B).
% 1.62/1.80  
% 1.62/1.80  ======= end of input processing =======
% 1.62/1.80  
% 1.62/1.80  =========== start of search ===========
% 1.62/1.80  
% 1.62/1.80  -------- PROOF -------- 
% 1.62/1.80  
% 1.62/1.80  ----> UNIT CONFLICT at   0.00 sec ----> 11 [binary,10.1,6.1] $F.
% 1.62/1.80  
% 1.62/1.80  Length of proof is 3.  Level of proof is 3.
% 1.62/1.80  
% 1.62/1.80  ---------------- PROOF ----------------
% 1.62/1.80  % SZS status Theorem
% 1.62/1.80  % SZS output start Refutation
% See solution above
% 1.62/1.80  ------------ end of proof -------------
% 1.62/1.80  
% 1.62/1.80  
% 1.62/1.80  Search stopped by max_proofs option.
% 1.62/1.80  
% 1.62/1.80  
% 1.62/1.80  Search stopped by max_proofs option.
% 1.62/1.80  
% 1.62/1.80  ============ end of search ============
% 1.62/1.80  
% 1.62/1.80  -------------- statistics -------------
% 1.62/1.80  clauses given                  3
% 1.62/1.80  clauses generated              4
% 1.62/1.80  clauses kept                  10
% 1.62/1.80  clauses forward subsumed       1
% 1.62/1.80  clauses back subsumed          3
% 1.62/1.80  Kbytes malloced              976
% 1.62/1.80  
% 1.62/1.80  ----------- times (seconds) -----------
% 1.62/1.80  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.62/1.80  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.62/1.80  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.62/1.80  
% 1.62/1.80  That finishes the proof of the theorem.
% 1.62/1.80  
% 1.62/1.80  Process 2071 finished Wed Jul 27 11:12:07 2022
% 1.62/1.80  Otter interrupted
% 1.62/1.80  PROOF FOUND
%------------------------------------------------------------------------------