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

View Problem - Process Solution

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

% Computer : n019.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:14 EDT 2022

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

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

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

cnf(3,axiom,
    ~ big_f(dollar_f1(A),dollar_f1(A)),
    file('SYN326+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( big_g(dollar_f2(A))
    | big_f(A,A) ),
    file('SYN326+1.p',unknown),
    [] ).

cnf(9,plain,
    ( big_f(A,A)
    | big_h(dollar_f1(dollar_f2(A))) ),
    inference(hyper,[status(thm)],[5,2]),
    [iquote('hyper,5,2')] ).

cnf(11,plain,
    big_f(A,A),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[9,1]),3]),
    [iquote('hyper,9,1,unit_del,3')] ).

cnf(12,plain,
    $false,
    inference(binary,[status(thm)],[11,3]),
    [iquote('binary,11.1,3.1')] ).

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