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

View Problem - Process Solution

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

% Computer : n025.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:17 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ p1(A,f(B))
    | q1(f(A),B)
    | q2(A,f(B)) ),
    file('SYN006-1.p',unknown),
    [] ).

cnf(2,axiom,
    ~ q2(A,f(B)),
    file('SYN006-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ p2(A,f(B))
    | q3(f(A),B)
    | q4(A,f(B)) ),
    file('SYN006-1.p',unknown),
    [] ).

cnf(4,axiom,
    ~ q3(A,g(B)),
    file('SYN006-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ q4(f(f(A)),f(g(f(B)))),
    file('SYN006-1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ q1(A,f(B))
    | p2(f(A),B) ),
    file('SYN006-1.p',unknown),
    [] ).

cnf(7,axiom,
    p1(a,A),
    file('SYN006-1.p',unknown),
    [] ).

cnf(8,plain,
    q1(f(a),A),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[7,1]),2]),
    [iquote('hyper,7,1,unit_del,2')] ).

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

cnf(10,plain,
    ( q3(f(f(f(a))),A)
    | q4(f(f(a)),f(A)) ),
    inference(hyper,[status(thm)],[9,3]),
    [iquote('hyper,9,3')] ).

cnf(11,plain,
    q3(f(f(f(a))),g(f(A))),
    inference(hyper,[status(thm)],[10,5]),
    [iquote('hyper,10,5')] ).

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

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