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

View Problem - Process Solution

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

% Computer : n013.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:55 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( p2(f5(A),f5(B))
    | ~ p4(A,B) ),
    file('SYN564-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( p4(A,B)
    | ~ p4(C,A)
    | ~ p4(C,B) ),
    file('SYN564-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ p10(f9(f5(c11),f5(c12)),f5(f8(c11,c12))),
    file('SYN564-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( p10(f9(A,B),C)
    | ~ p10(A,f3(C,B)) ),
    file('SYN564-1.p',unknown),
    [] ).

cnf(8,axiom,
    ( p10(A,B)
    | ~ p2(C,A)
    | ~ p2(D,B)
    | ~ p10(C,D) ),
    file('SYN564-1.p',unknown),
    [] ).

cnf(11,axiom,
    ( p2(f9(A,B),f9(C,D))
    | ~ p2(A,C)
    | ~ p2(B,D) ),
    file('SYN564-1.p',unknown),
    [] ).

cnf(13,axiom,
    p2(A,A),
    file('SYN564-1.p',unknown),
    [] ).

cnf(14,axiom,
    p4(A,A),
    file('SYN564-1.p',unknown),
    [] ).

cnf(15,axiom,
    p2(f5(f7(A)),f5(A)),
    file('SYN564-1.p',unknown),
    [] ).

cnf(16,axiom,
    p4(f8(A,B),f6(A,f7(B))),
    file('SYN564-1.p',unknown),
    [] ).

cnf(18,axiom,
    p10(f5(A),f3(f5(f6(A,B)),f5(B))),
    file('SYN564-1.p',unknown),
    [] ).

cnf(20,plain,
    p2(f9(A,f5(f7(B))),f9(A,f5(B))),
    inference(hyper,[status(thm)],[15,11,13]),
    [iquote('hyper,15,11,13')] ).

cnf(60,plain,
    p4(f6(A,f7(B)),f8(A,B)),
    inference(hyper,[status(thm)],[16,4,14]),
    [iquote('hyper,16,4,14')] ).

cnf(154,plain,
    p10(f9(f5(A),f5(B)),f5(f6(A,B))),
    inference(hyper,[status(thm)],[18,7]),
    [iquote('hyper,18,7')] ).

cnf(170,plain,
    p2(f5(f6(A,f7(B))),f5(f8(A,B))),
    inference(hyper,[status(thm)],[60,1]),
    [iquote('hyper,60,1')] ).

cnf(2186,plain,
    p10(f9(f5(A),f5(B)),f5(f8(A,B))),
    inference(hyper,[status(thm)],[170,8,20,154]),
    [iquote('hyper,170,8,20,154')] ).

cnf(2187,plain,
    $false,
    inference(binary,[status(thm)],[2186,5]),
    [iquote('binary,2186.1,5.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN564-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n013.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:07:15 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.87/2.07  ----- Otter 3.3f, August 2004 -----
% 1.87/2.07  The process was started by sandbox2 on n013.cluster.edu,
% 1.87/2.07  Wed Jul 27 11:07:15 2022
% 1.87/2.07  The command was "./otter".  The process ID is 28428.
% 1.87/2.07  
% 1.87/2.07  set(prolog_style_variables).
% 1.87/2.07  set(auto).
% 1.87/2.07     dependent: set(auto1).
% 1.87/2.07     dependent: set(process_input).
% 1.87/2.07     dependent: clear(print_kept).
% 1.87/2.07     dependent: clear(print_new_demod).
% 1.87/2.07     dependent: clear(print_back_demod).
% 1.87/2.07     dependent: clear(print_back_sub).
% 1.87/2.07     dependent: set(control_memory).
% 1.87/2.07     dependent: assign(max_mem, 12000).
% 1.87/2.07     dependent: assign(pick_given_ratio, 4).
% 1.87/2.07     dependent: assign(stats_level, 1).
% 1.87/2.07     dependent: assign(max_seconds, 10800).
% 1.87/2.07  clear(print_given).
% 1.87/2.07  
% 1.87/2.07  list(usable).
% 1.87/2.07  0 [] p2(X9,X9).
% 1.87/2.07  0 [] p4(X23,X23).
% 1.87/2.07  0 [] p2(f5(f7(X18)),f5(X18)).
% 1.87/2.07  0 [] p4(f8(X38,X39),f6(X38,f7(X39))).
% 1.87/2.07  0 [] p4(f7(f8(X32,X33)),f8(X33,X32)).
% 1.87/2.07  0 [] p2(f5(X16),f5(X17))| -p4(X16,X17).
% 1.87/2.07  0 [] p4(f7(X30),f7(X31))| -p4(X30,X31).
% 1.87/2.07  0 [] p2(X10,X11)| -p2(X9,X10)| -p2(X9,X11).
% 1.87/2.07  0 [] p4(X24,X25)| -p4(X23,X24)| -p4(X23,X25).
% 1.87/2.07  0 [] p10(f5(X7),f3(f5(f6(X7,X8)),f5(X8))).
% 1.87/2.07  0 [] -p10(f9(f5(c11),f5(c12)),f5(f8(c11,c12))).
% 1.87/2.07  0 [] p10(X4,f3(X5,X6))| -p10(f9(X4,X6),X5).
% 1.87/2.07  0 [] p10(f9(X4,X6),X5)| -p10(X4,f3(X5,X6)).
% 1.87/2.07  0 [] p10(X0,X1)| -p2(X2,X0)| -p2(X3,X1)| -p10(X2,X3).
% 1.87/2.07  0 [] p4(f8(X34,X35),f8(X36,X37))| -p4(X34,X36)| -p4(X35,X37).
% 1.87/2.07  0 [] p2(f3(X12,X13),f3(X14,X15))| -p2(X12,X14)| -p2(X13,X15).
% 1.87/2.07  0 [] p2(f9(X19,X20),f9(X21,X22))| -p2(X19,X21)| -p2(X20,X22).
% 1.87/2.07  0 [] p4(f6(X26,X27),f6(X28,X29))| -p4(X26,X28)| -p4(X27,X29).
% 1.87/2.07  end_of_list.
% 1.87/2.07  
% 1.87/2.07  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.87/2.07  
% 1.87/2.07  This is a Horn set without equality.  The strategy will
% 1.87/2.07  be hyperresolution, with satellites in sos and nuclei
% 1.87/2.07  in usable.
% 1.87/2.07  
% 1.87/2.07     dependent: set(hyper_res).
% 1.87/2.07     dependent: clear(order_hyper).
% 1.87/2.07  
% 1.87/2.07  ------------> process usable:
% 1.87/2.07  ** KEPT (pick-wt=8): 1 [] p2(f5(A),f5(B))| -p4(A,B).
% 1.87/2.07  ** KEPT (pick-wt=8): 2 [] p4(f7(A),f7(B))| -p4(A,B).
% 1.87/2.07  ** KEPT (pick-wt=9): 3 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.87/2.07  ** KEPT (pick-wt=9): 4 [] p4(A,B)| -p4(C,A)| -p4(C,B).
% 1.87/2.07  ** KEPT (pick-wt=10): 5 [] -p10(f9(f5(c11),f5(c12)),f5(f8(c11,c12))).
% 1.87/2.07  ** KEPT (pick-wt=10): 6 [] p10(A,f3(B,C))| -p10(f9(A,C),B).
% 1.87/2.07  ** KEPT (pick-wt=10): 7 [] p10(f9(A,B),C)| -p10(A,f3(C,B)).
% 1.87/2.07  ** KEPT (pick-wt=12): 8 [] p10(A,B)| -p2(C,A)| -p2(D,B)| -p10(C,D).
% 1.87/2.07  ** KEPT (pick-wt=13): 9 [] p4(f8(A,B),f8(C,D))| -p4(A,C)| -p4(B,D).
% 1.87/2.07  ** KEPT (pick-wt=13): 10 [] p2(f3(A,B),f3(C,D))| -p2(A,C)| -p2(B,D).
% 1.87/2.07  ** KEPT (pick-wt=13): 11 [] p2(f9(A,B),f9(C,D))| -p2(A,C)| -p2(B,D).
% 1.87/2.07  ** KEPT (pick-wt=13): 12 [] p4(f6(A,B),f6(C,D))| -p4(A,C)| -p4(B,D).
% 1.87/2.07  
% 1.87/2.07  ------------> process sos:
% 1.87/2.07  ** KEPT (pick-wt=3): 13 [] p2(A,A).
% 1.87/2.07  ** KEPT (pick-wt=3): 14 [] p4(A,A).
% 1.87/2.07  ** KEPT (pick-wt=6): 15 [] p2(f5(f7(A)),f5(A)).
% 1.87/2.07  ** KEPT (pick-wt=8): 16 [] p4(f8(A,B),f6(A,f7(B))).
% 1.87/2.07  ** KEPT (pick-wt=8): 17 [] p4(f7(f8(A,B)),f8(B,A)).
% 1.87/2.07  ** KEPT (pick-wt=10): 18 [] p10(f5(A),f3(f5(f6(A,B)),f5(B))).
% 1.87/2.07  
% 1.87/2.07  ======= end of input processing =======
% 1.87/2.07  
% 1.87/2.07  =========== start of search ===========
% 1.87/2.07  
% 1.87/2.07  -------- PROOF -------- 
% 1.87/2.07  
% 1.87/2.07  ----> UNIT CONFLICT at   0.05 sec ----> 2187 [binary,2186.1,5.1] $F.
% 1.87/2.07  
% 1.87/2.07  Length of proof is 5.  Level of proof is 3.
% 1.87/2.07  
% 1.87/2.07  ---------------- PROOF ----------------
% 1.87/2.07  % SZS status Unsatisfiable
% 1.87/2.07  % SZS output start Refutation
% See solution above
% 1.87/2.07  ------------ end of proof -------------
% 1.87/2.07  
% 1.87/2.07  
% 1.87/2.07  Search stopped by max_proofs option.
% 1.87/2.07  
% 1.87/2.07  
% 1.87/2.07  Search stopped by max_proofs option.
% 1.87/2.07  
% 1.87/2.07  ============ end of search ============
% 1.87/2.07  
% 1.87/2.07  -------------- statistics -------------
% 1.87/2.07  clauses given                 43
% 1.87/2.07  clauses generated           2591
% 1.87/2.07  clauses kept                2186
% 1.87/2.07  clauses forward subsumed     423
% 1.87/2.07  clauses back subsumed          0
% 1.87/2.07  Kbytes malloced             2929
% 1.87/2.07  
% 1.87/2.07  ----------- times (seconds) -----------
% 1.87/2.07  user CPU time          0.05          (0 hr, 0 min, 0 sec)
% 1.87/2.07  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.87/2.07  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.87/2.07  
% 1.87/2.07  That finishes the proof of the theorem.
% 1.87/2.07  
% 1.87/2.07  Process 28428 finished Wed Jul 27 11:07:16 2022
% 1.87/2.07  Otter interrupted
% 1.87/2.07  PROOF FOUND
%------------------------------------------------------------------------------